topologicalOrdering {dagitty} | R Documentation |
Computes a topological ordering of the nodes, i.e., a number for each node such that every node's number is smaller than the one of all its descendants. Bidirected edges (<->) are ignored.
topologicalOrdering(x)
x |
the input graph, a DAG |