8.1.7. networkx.algorithms.dag.transitive_closure¶

networkx.algorithms.dag.transitive_closure(G)[source]¶

Returns transitive closure of a directed graph

The transitive closure of G = (V,E) is a graph G+ = (V,E+) such that for all v,w in V there is an edge (v,w) in E+ if and only if there is a non-null path from v to w in G.

Parameters:	G : NetworkX DiGraph Graph
Returns:	TC : NetworkX DiGraph Graph
Raises:	NetworkXNotImplemented If G is not directed

References

[R636]

http://www.ics.uci.edu/~eppstein/PADS/PartialOrder.py