Skip to contents

A graph is a DAG if it is Directed and Acyclic.

Usage

IsDAG(arcSources, arcTargets, numNodes)

Arguments

arcSources

Vector corresponding to the source nodes of a graph's edges

arcTargets

Vector corresponding to the destination nodes of a graph's edges

numNodes

The number of nodes in the graph

Value

A logical stating if the graph is DAG