Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!
Get Started for Free

topologicalOrdering

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


dagitty

Graphical Analysis of Structural Causal Models

v0.3-1
GPL-2
Authors
Johannes Textor, Benito van der Zander, Ankur Ankan
Initial release
2021-01-20

We don't support your browser anymore

Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.