CycleDetectionUtils

```
public class CycleDetectionUtils
extends java.lang.Object
```
Cycle detection util class on top of SCCSearch algorithm classes. Notice that you can also use SimpleOrientedGraph class if you are sure that you can construct a static graph without entering in a cycle while constructing it. What is nice of first way is that you define how to get the successors and the cycle is computed while processing this. You can also get SimpleOrientedGraph static construction way if you use BasicDirectGraph implementation of IDirectedGraph.

Constructors
Constructor and Description
`CycleDetectionUtils()`

All Methods Static Methods Concrete Methods
Modifier and Type	Method and Description
`static <T> boolean`	`containsCycles(IDirectedGraph<T> graph)` Just check if we found at least one cycle.
`static <T> java.util.List<java.util.List<T>>`	`getCycles(IDirectedGraph<T> graph)` Get cycles of the graph

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Class CycleDetectionUtils