[ library(graph_algorithms) | Reference Manual | Alphabetic Index ]
# graph_cycles(+Graph, -BreakingEdges)

Computes a list of edges whose removal would make the graph acyclic
*Graph*
- a graph structure
*BreakingEdges*
- a list of e/3 edge structures

## Description

Computes a set of edges whose removal would make the graph acyclic.
This set is not necessarily minimal, and it contains an arbitrary
edge from every cycle in the graph.

If the list is empty, the graph is already acyclic.

### Modes and Determinism

- graph_cycles(+, -) is det

## See Also

graph_is_acyclic / 1, top_sort / 2