topologicalOrdering

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 (&lt;-&gt;) are ignored.

A port of the web-based software 'DAGitty', available at
<https://dagitty.net>, for analyzing structural causal models
(also known as directed acyclic graphs or DAGs).
This package computes covariate adjustment sets for estimating causal
effects, enumerates instrumental variables, derives testable
implications (d-separation and vanishing tetrads), generates equivalent
models, and includes a simple facility for data simulation.

Johannes Textor

dagitty

Graphical Analysis of Structural Causal Models

topologicalOrdering function

<dl><dt>x</dt>
<dd>the input graph, a DAG</dd></dl>

Arguments

Get Topological Ordering of DAG — topologicalOrdering

<dl>

<dt>x</dt>
<dd>the input graph, a DAG</dd>

</dl>

The Learning Leader's Guide to AI Literacy

topologicalOrdering: Get Topological Ordering of DAG

Description

Usage

Arguments