| topologicalOrdering {dagitty} | R Documentation |
Get Topological Ordering of DAG
Description
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.
Usage
topologicalOrdering(x)
Arguments
x |
the input graph, a DAG |
[Package dagitty version 0.3-4 Index]