class_docstr: A graph representation that works directly with the maxflow.GraphDouble graph as
  base. It is therefore less flexible as graph.Graph, but leads to lower memory
  requirements.
  
  The graph contains nodes, edges (directed) between the nodes (n-edges), edges
  between two terminals (called source and sink) and the nodes (t-edges), and a
  weight for each edge. 
  
  Notes
  -----
  The node-ids used by the graph are assumed to start with 0 and be
  continuous. This is not actually checked, so be careful.
  
  This wrapper tries to catch the most usual exception that can occur in the
  underlying C++ implementation and to convert them into catchable and meaningful
  error messages.
docstr: Get the number of edges.
  
  Returns
  -------
  edge_count : int
      The number of edges.
docstr_tok: ["Get","the","number","of","edges",".","Returns","--","--","--","-","edge_count",":","int","The","number","of","edges","."]
code: def get_edge_count(self):
      r"""
      Get the number of edges.
  
      Returns
      -------
      edge_count : int
          The number of edges.
      """
      return self.__edges
  
imports: from .maxflow import GraphDouble, GraphFloat
label_desc: Use image node_id 12 for calling the GCGraph obj's underlying member method code with example usage: obj.get_edge_count() and returns: self