topologicalOrdering: Get Topological Ordering of DAG
In dagitty: Graphical Analysis of Structural Causal Models
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
1
Arguments
x
the input graph, a DAG
dagitty documentation built on Jan. 21, 2021, 5:07 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
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
1 |
Arguments
x |
the input graph, a DAG |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.