anchor.diff:      member this.Degree(v:'Vertex) :int =
           try
              vertexOutEdges.Item v
  -           |> Array.length
  +           //|> Array.length
  +           |> Array.sumBy (fun (s,t,w) -> if s=t then 2 else 1)
           with
           |_ -> failwithf "The vertex %O does not exist in the graph." v
   
  
positive.code:     
      ///Removes an edge from the graph.
      member this.RemoveEdge((s, t, w): LEdge<'Vertex,'Edge>) =
          let edgeArraySource = 
              try 
                  vertexOutEdges.Item s
                  |> Array.filter (fun x -> x <> (s, t, w) )
              with
              |_ -> failwithf "The source vertex %O of the edge does not exist in this graph." s
  
          let edgeArrayTarget = 
              try
                  vertexOutEdges.Item t
                  |> Array.filter (fun x -> x <> (s, t, w) )
              with
              |_ -> failwithf "The target vertex %O of the edge does not exist in this graph." t        
          
          vertexOutEdges.Item s <- (edgeArraySource)
          vertexOutEdges.Item t <- (edgeArrayTarget)
          this
  
      ///Removes an array of edges from the graph.
  
negative.code:         graph.OutDegree v
  
      ///Returns the weighted degree of the vertex v.
      let weightedDegree (weightingF : 'Edge -> float) (v:'Vertex) (graph: ArrayAdjacencyGraph<'Vertex,'Label,'Edge>) :float =
          graph.WeightedDegree (weightingF,v)
  
      ///Returns false if the vertex v does not have edges connected to it. Otherwise, it returns true.
  