grapharray.classes.BaseGraph
============================

.. currentmodule:: grapharray.classes

.. autoclass:: BaseGraph

   
   .. automethod:: __init__

   
   .. rubric:: Methods

   .. autosummary::
   
      ~BaseGraph.__init__
      ~BaseGraph.add_edge
      ~BaseGraph.add_edges_from
      ~BaseGraph.add_node
      ~BaseGraph.add_nodes_from
      ~BaseGraph.add_weighted_edges_from
      ~BaseGraph.adjacency
      ~BaseGraph.clear
      ~BaseGraph.clear_edges
      ~BaseGraph.copy
      ~BaseGraph.edge_subgraph
      ~BaseGraph.freeze
      ~BaseGraph.get_edge_data
      ~BaseGraph.has_edge
      ~BaseGraph.has_node
      ~BaseGraph.has_predecessor
      ~BaseGraph.has_successor
      ~BaseGraph.is_directed
      ~BaseGraph.is_multigraph
      ~BaseGraph.nbunch_iter
      ~BaseGraph.neighbors
      ~BaseGraph.number_of_edges
      ~BaseGraph.number_of_nodes
      ~BaseGraph.order
      ~BaseGraph.predecessors
      ~BaseGraph.remove_edge
      ~BaseGraph.remove_edges_from
      ~BaseGraph.remove_node
      ~BaseGraph.remove_nodes_from
      ~BaseGraph.reverse
      ~BaseGraph.size
      ~BaseGraph.subgraph
      ~BaseGraph.successors
      ~BaseGraph.to_directed
      ~BaseGraph.to_directed_class
      ~BaseGraph.to_undirected
      ~BaseGraph.to_undirected_class
      ~BaseGraph.update
   
   

   
   
   .. rubric:: Attributes

   .. autosummary::
   
      ~BaseGraph.adj
      ~BaseGraph.degree
      ~BaseGraph.edge_to_index
      ~BaseGraph.edges
      ~BaseGraph.in_degree
      ~BaseGraph.in_edges
      ~BaseGraph.name
      ~BaseGraph.node_to_index
      ~BaseGraph.nodes
      ~BaseGraph.out_degree
      ~BaseGraph.out_edges
      ~BaseGraph.pred
      ~BaseGraph.succ