MultiDiGraph---Directed graphs with self loops and parallel edges
.. currentmodule:: networkx
.. autoclass:: MultiDiGraph
Adding and Removing Nodes and Edges
.. autosummary::
:toctree: generated/
MultiDiGraph.__init__
MultiDiGraph.add_node
MultiDiGraph.add_nodes_from
MultiDiGraph.remove_node
MultiDiGraph.remove_nodes_from
MultiDiGraph.add_edge
MultiDiGraph.add_edges_from
MultiDiGraph.add_weighted_edges_from
MultiDiGraph.new_edge_key
MultiDiGraph.remove_edge
MultiDiGraph.remove_edges_from
MultiDiGraph.clear
Iterating over nodes and edges
.. autosummary::
:toctree: generated/
MultiDiGraph.nodes
MultiDiGraph.__iter__
MultiDiGraph.edges
MultiDiGraph.out_edges
MultiDiGraph.in_edges
MultiDiGraph.get_edge_data
MultiDiGraph.neighbors
MultiDiGraph.__getitem__
MultiDiGraph.successors
MultiDiGraph.predecessors
MultiDiGraph.adjacency
MultiDiGraph.nbunch_iter
Information about graph structure
.. autosummary::
:toctree: generated/
MultiDiGraph.has_node
MultiDiGraph.__contains__
MultiDiGraph.has_edge
MultiDiGraph.order
MultiDiGraph.number_of_nodes
MultiDiGraph.__len__
MultiDiGraph.degree
MultiDiGraph.in_degree
MultiDiGraph.out_degree
MultiDiGraph.size
MultiDiGraph.number_of_edges
MultiDiGraph.nodes_with_selfloops
MultiDiGraph.selfloop_edges
MultiDiGraph.number_of_selfloops
Making copies and subgraphs
.. autosummary::
:toctree: generated/
MultiDiGraph.copy
MultiDiGraph.to_undirected
MultiDiGraph.to_directed
MultiDiGraph.edge_subgraph
MultiDiGraph.subgraph
MultiDiGraph.reverse