dominance_frontiers(G, start)
The graph where dominance is to be computed.
The start node of dominance computation.
A dict containing the dominance frontiers of each node reachable from :None:None:`start` as lists.
Returns the dominance frontiers of all nodes of a directed graph.
>>> G = nx.DiGraph([(1, 2), (1, 3), (2, 5), (3, 4), (4, 5)])See :
... sorted((u, sorted(df)) for u, df in nx.dominance_frontiers(G, 1).items()) [(1, []), (2, [5]), (3, [5]), (4, [5]), (5, [])]
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.dominance.dominance_frontiers
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