
graph_is_acyclic(+Graph)

   Succeeds iff the given graph has no cycles

Arguments
   Graph               a graph structure

Type
   library(graph_algorithms)

Modes and Determinism
   graph_is_acyclic(+) is semidet

Fail Conditions
   No topological ordering exists, i.e. the graph is cyclic

See Also
   top_sort / 2, graph_cycles / 2
