Inheritance diagram for networkx::xbase::XDiGraph:

A class implementing general digraphs, allowing (optional) self-loops, (optional) multiple edges, arbitrary (hashable) objects as nodes, and arbitrary objects associated with edges. As in XGraph, an XDiGraph edge is uniquely specified by a 3-tuple e=(n1,n2,x), where n1 and n2 are (hashable) objects (nodes) and x is an arbitrary (and not necessarily unique) object associated with that edge. See the documentation of XGraph for the use of the optional parameters selfloops (defaults is False) and multiedges (default is False). XDiGraph inherits from DiGraph, with all purely node-specific methods identical to those of DiGraph. XDiGraph edges are identical to XGraph edges, except that they are directed rather than undirected. XDiGraph replaces the following DiGraph methods: - __init__: read multiedges and selfloops kwds. - add_edge - add_edges_from - delete_edge - delete_edges_from - delete_multiedge - has_edge - edges_iter - degree_iter - degree - copy - clear - subgraph - is_directed - to_directed XDiGraph also adds the following methods to those of DiGraph: - allow_selfloops - remove_all_selfloops - ban_selfloops - allow_multiedges - ban_multiedges - remove_all_multiedges XDigraph adds the following methods to those of XGraph: - has_successor - successors - successors_iter - has_predecessor - predecessors - predecessors_iter - out_degree - out_degree_iter - in_degree - in_degree_iter - to_undirected - is_directed

Definition at line 856 of file xbase.py.

The documentation for this class was generated from the following file:

- networkx-0.32/networkx/xbase.py

Generated by Doxygen 1.6.0 Back to index