build_auxiliary_node_connectivity(G)
For an undirected graph G having :None:None:`n` nodes and :None:None:`m` edges we derive a directed graph D with :None:None:`2n` nodes and :None:None:`2m+n` arcs by replacing each original node :None:None:`v` with two nodes :None:None:`vA`, :None:None:`vB` linked by an (internal) arc in D. Then for each edge (:None:None:`u`, :None:None:`v`) in G we add two arcs (:None:None:`uB`, :None:None:`vA`) and (:None:None:`vB`, :None:None:`uA`) in D. Finally we set the attribute capacity = 1 for each arc in D .
For a directed graph having :None:None:`n` nodes and :None:None:`m` arcs we derive a directed graph D with :None:None:`2n` nodes and :None:None:`m+n` arcs by replacing each original node :None:None:`v` with two nodes :None:None:`vA`, :None:None:`vB` linked by an (internal) arc (:None:None:`vA`, :None:None:`vB`) in D. Then for each arc (:None:None:`u`, :None:None:`v`) in G we add one arc (:None:None:`uB`, :None:None:`vA`) in D. Finally we set the attribute capacity = 1 for each arc in D.
A dictionary with a mapping between nodes in the original graph and the auxiliary digraph is stored as a graph attribute: H.graph['mapping'].
Creates a directed graph D from an undirected graph G to compute flow based node connectivity.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.cuts.minimum_st_node_cut
networkx.algorithms.connectivity.connectivity.local_node_connectivity
networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them