anchor.diff:      let weightedDegree (weightingF : LEdge<'Vertex,'Edge> [] -> 'T) (v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :'T =
           graph.WeightedDegree (weightingF,v)
   
  -    ///Returns true, if the vertex v does not have edges connected to it. Otherwise, it returns false.
  -    let connectedEdgesEmpty(v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :bool =
  -        graph.ConnectedEdgesEmpty v
  +    ///Returns false if the vertex v does not have edges connected to it. Otherwise, it returns true.
  +    let isConnectedToEdges (v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :bool =
  +        not (graph.ConnectedEdgesEmpty v)
   
       ///Returns a new graph with the given vertex added.
  -    let addVertex ((v, l): LVertex<'Vertex,'Label>) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
  +    let add ((v, l): LVertex<'Vertex,'Label>) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
           (graph.Copy()).AddVertex(v, l)
   
       ///Returns a new graph with the given vertices added.    
  -    let addManyVertices (vertices:LVertex<'Vertex,'Label>[]) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =       
  +    let addMany (vertices:LVertex<'Vertex,'Label>[]) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =       
           (graph.Copy()).AddManyVertices(vertices)
   
       ///Returns a new graph where the given vertex is removed.
  -    let removeVertex (v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =       
  +    let remove (v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =       
           (graph.Copy()).RemoveVertex(v)
   
       ///Returns a new graph where the given vertices are removed.
  -    let removeManyVertices (vertices:'Vertex[]) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
  +    let removeMany (vertices:'Vertex[]) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
           (graph.Copy()).RemoveManyVertices(vertices)
    
       ///Returns Some vertices if they are predecessors of the vertex, else None.
  
positive.code:             result.[i] <- group.Value
              i <- i+1
          result       
    
  module Vertices =
      //Vertices
      ///Returns true, if the graph contains the vertex, else false.
      let containsVertex (vertex:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :bool =
          graph.ContainsVertex vertex
  
      ///Returns the number of vertices of the graph.
      let vertexCount (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :int =
          graph.VertexCount
  
      ///Returns the vertices of the graph.
      let getVertices (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :'Vertex[]=
          graph.GetVertices()
      
      ///Returns the degree of the vertex v.
  
negative.code:         (graph.Copy()).SetWeight(source,target,weight)
    
      ///Returns a new graph where the given edge was added.
      let add ((s, t, w) : LEdge<'Vertex,'Edge>) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
          (graph.Copy()).AddEdge(s,t,w)
      
      ///Returns a new graph where the given edges were added.
      let addMany edgeArray (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
         (graph.Copy()).AddManyEdges(edgeArray)
      
      ///Returns a new graph where the given edge was removed from the original graph.
      let remove ((s, t, w): LEdge<'Vertex,'Edge>) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
          (graph.Copy()).RemoveEdge(s, t, w)
  
      ///Returns a new graph where the given edges were removed from the original graph.
      let removeMany (edges:LEdge<'Vertex,'Edge>[]) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) : ArrayAdjacencyGraph<'Vertex,'Label,'Edge> =
         (graph.Copy()).RemoveManyEdges(edges)
  