Check if Graph is DAG, then Sorts Nodes into Topological Order

Checks if a directed graph is a Direct Acyclic Graph (DAG) and returns the topological order.

Usage

GetAndCheckTopologicalSort(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 named list containing 1) "is_DAG": a logical stating if the graph is a DAG, and 2) "indices": a vector of length numNodes, containing the index of vertex i in the ordering at location i

Details

See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#gaf10c5e1630e5720c20d83cfb77dbf024 for more information.