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.
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
Details
See https://lemon.cs.elte.hu/pub/doc/1.3.1/a00616.html#ga14c191b2133a1dd23e1527f074c821c0 for more information.