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:                | Some x    -> x                    
                 | None      -> failwithf "The target vertex %O of the edge does not exist in this graph." t
     
         // Array.append benutzen
         vertexOutEdges.Item s <- (Array.concat [[|(s,t,w)|];edgeArraySource])
         vertexOutEdges.Item t <- (Array.concat [[|(s,t,w)|];edgeArrayTarget])
         this
  
negative.code:          |Some x -> x
           |None   -> failwithf "The vertex %O does not exist in the graph." v
  
      //Label
      ///Returns Some label, if a label for the vertex v exists, else none.
      member this.TryGetLabel(v:'Vertex) :'Label option =        
  