anchor.diff:                  (edgesGraph|>List.distinct|>List.sort)              
                   (edges|>List.distinct|>List.sort)
                   "the edgeList of the graph does not match the data used to create the graph"
  -        )   
  +        )  
  +        testCase "from empty Lists to Graph" (fun () ->            
  +            let vertexList = 
  +                [
  +
  +                ]
  +            
  +            let edges =
  +                [
  +
  +                ]
  +            
  +            let graph = FSharp.FGL.Undirected.Graph.create vertexList edges
  +
  +            let verticesGraph   = Vertices.toVertexList graph
  +
  +            let edgesGraph      = 
  +                Undirected.Edges.toEdgeList graph
  +                        
  +            Expect.sequenceEqual 
  +                verticesGraph
  +                vertexList
  +                "The vertexList of the graph does not match the data used to create the graph"
  +        
  +            Expect.sequenceEqual
  +                (edgesGraph|>List.distinct|>List.sort)              
  +                (edges|>List.distinct|>List.sort)
  +                "The edgeList of the graph does not match the data used to create the graph"
  +                
  +            Expect.equal
  +                graph
  +                (Directed.Graph.create vertexList edges)
  +                "The undirected Graph and the directed Graph of the empty lists return different empty graphs"
  +        )    
       ]   
   
   [<Tests>]
  
positive.code: 
      testList "FGL.Graph"[
  
          testCase "Decompose"(fun () ->
  
              let vertexList =
                  [
  
negative.code:             
              let edges =
                  [
                      for i=0 to 99 do
                          i,(i+1),1
                      for i=2 to 50 do
                          i,(i+i),1
                  ]
              
              let graph = FSharp.FGL.Undirected.Graph.create vertexList edges
  