anchor.diff:                          
               
               let g = FSharp.FGL.Undirected.Graph.create vertexList edgeList 
  -            
  +
  +            let toBeDecomposed =
  +                //rnd.Next(0,5)
  +                3
  +
               let gDecomposed =
  -                FSharp.FGL.Graph.decompose 3 g
  +                FSharp.FGL.Graph.decompose toBeDecomposed g
                   |> snd
   
               let vertexListDecomposed =
  
positive.code: [<Tests>]
  let testFGLGraph =
  
      testList "Graph.decompose"[
  
          testCase "does Graph.decompose remove the correct edges"(fun () ->
  
              
              let vertexList =
                  [
                      for i=0 to 5 do
  
negative.code:             let edgeListDecomposed =
                  Undirected.Edges.toEdgeList gDecomposed
  
  
              let listTripelLowestSource (edgeList) =
                  edgeList
                  |> List.map(fun (s,t,w) ->
                      if s < t then
                          (s,t,w)
                      else
                          (t,s,w)
                  )
  
              Expect.sequenceEqual
                  (vertexList|> List.choose(fun (v,l) -> if v <> toBeDecomposed then Some (v,l) else None))
                  vertexListDecomposed
                  "vertexList of the decomposed Graph is equal to the expected values "
  
              Expect.isTrue
                  ((edgeListDecomposed|>listTripelLowestSource)=(FSharp.FGL.Undirected.Edges.toEdgeList g|>listTripelLowestSource|> List.choose(fun (s,t,w) -> if s <> toBeDecomposed && t <> toBeDecomposed then Some (s,t,w) else None)))
                  "edgeList of the decomposed Graph is equal to the expected values "
  
          )
  
  