anchor.diff:              newDict.Add(kv.Key,innerCopyF kv.Value)
           newDict
   
  -//----- Louvain ----------
  -//                         \
  -//----- Graph -> PR FGL ->  -> Louvain auf AA Graph
  -//
  -
  +
  +///  A mutable directed graph data structure efficient for large sparse graph representations
  +//  Adaptation of https://github.com/YaccConstructor/QuickGraph.
   type ArrayAdjacencyGraph<'Vertex,'Label,'Edge when 'Vertex : equality and 'Edge : equality> internal (vertexEdges:Dictionary<'Vertex,LEdge<'Vertex,'Edge>[]>, labels:Dictionary<'Vertex,'Label>) =
       
       // Dictionary of the labels belonging to the vertices with (k,v) k-> vertex, v-> label.
  
positive.code:            this.RemoveEdge edge |> ignore
         this
      
      //
      //Vertices
      ///Returns true, if the graph contains the vertex, else false.
      member this.ContainsVertex(vertex:'Vertex) :bool =
  
negative.code:         this.TryGetOutEdges v
          |> Option.map (Array.length)
  
      ///Returns the weighted degree of the vertex v.
      member this.WeightedDegree(weightingF : LEdge<'Vertex,'Edge> [] -> 'T,v:'Vertex) :'T =
          match (Dictionary.tryGetValue v vertexOutEdges) with
  