Skip to contents

A cycle is a path starting and ending in the same node and containing at least one other node. A acyclic graph contains no cycles.

Usage

IsAcyclic(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 acyclic