anchor.diff:                  |> Array.toList
                   |> List.sort
   
  -            Expect.equal
  +            Expect.sequenceEqual
                   edges
                   (exampleGraphEdges|>List.sort)
                   "TryGetOutEdges does not return the expected Value"
  
positive.code:                 (newSourceDegree-oldSourceDegree) = (newTargetDegree-oldTargetDegree)
              
              Expect.isTrue
                  (isEdgeNew&&inEdge&&outEdge&&isDegreeChangeSame)
                  "AddEdge does not add an edge correctly"
          )
          
          testCase "RemoveEdge" (fun () ->
  
negative.code:         
          testCase "ContainsEdgeTrue" (fun () ->
              
              let (s,t,w) =
                  exampleGraphEdges.[0]
  
              Expect.isTrue 
                  (testGraph.ContainsEdge(s,t,w))
                  "ContainsEdge returns true for edges that don´t exist"
          )
  
  