This documents the development version of NetworkX. Documentation for the current release can be found here.
Returns the transitive closure of a directed acyclic graph.
This function is faster than the function
transitive_closure, but fails if the graph has a cycle.
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.
- GNetworkX DiGraph
A directed acyclic graph (DAG)
- topo_order: list or tuple, optional
A topological order for G (if None, the function will compute one)
- NetworkX DiGraph
The transitive closure of
Gis not directed
Ghas a cycle
This algorithm is probably simple enough to be well-known but I didn’t find a mention in the literature.