Package com.jgalgo.alg.cycle
Class CyclesEnumeratorTarjan
java.lang.Object
com.jgalgo.alg.cycle.CyclesEnumeratorAbstract
com.jgalgo.alg.cycle.CyclesEnumeratorTarjan
- All Implemented Interfaces:
CyclesEnumerator
Tarjan's algorithm for enumeration all cycles in a directed graph.
The algorithm runs in \(O((n+m)(c+1))\) time and \(O(n)\) space where \(c\) is the number of simple cycles in the graph.
Based on the paper 'Enumeration of the elementary circuits of a directed graph' by Robert Tarjan.
- Author:
- Barak Ugav
-
Constructor Summary
-
Method Summary
Methods inherited from class com.jgalgo.alg.cycle.CyclesEnumeratorAbstract
cyclesIter
-
Constructor Details
-
CyclesEnumeratorTarjan
public CyclesEnumeratorTarjan()Create a new cycles enumeration algorithm object.Please prefer using
CyclesEnumerator.newInstance()
to get a default implementation for theCyclesEnumerator
interface.
-