This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Returns the dominance frontiers of all nodes of a directed graph.
- G (a DiGraph or MultiDiGraph) – The graph where dominance is to be computed.
- start (node) – The start node of dominance computation.
df – A dict containing the dominance frontiers of each node reachable from
dict keyed by nodes
startis not in
>>> G = nx.DiGraph([(1, 2), (1, 3), (2, 5), (3, 4), (4, 5)]) >>> sorted((u, sorted(df)) for u, df in nx.dominance_frontiers(G, 1).items()) [(1, ), (2, ), (3, ), (4, ), (5, )]
 K. D. Cooper, T. J. Harvey, and K. Kennedy. A simple, fast dominance algorithm. Software Practice & Experience, 4:110, 2001.