DominanceΒΆ
Dominance algorithms.
immediate_dominators (G, start) |
Returns the immediate dominators of all nodes of a directed graph. |
dominance_frontiers (G, start) |
Returns the dominance frontiers of all nodes of a directed graph. |
Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Dominance algorithms.
immediate_dominators (G, start) |
Returns the immediate dominators of all nodes of a directed graph. |
dominance_frontiers (G, start) |
Returns the dominance frontiers of all nodes of a directed graph. |