[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
# graph_is_acyclic(+Graph)

Succeeds iff the given graph has no cycles
*Graph*
- a graph structure

### 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