java.lang.Object
org.jgrapht.alg.cycle.TarjanSimpleCycles<V,E>
- Type Parameters:
V
- the vertex type.E
- the edge type.
- All Implemented Interfaces:
DirectedSimpleCycles<V,E>
public class TarjanSimpleCycles<V,E> extends java.lang.Object implements DirectedSimpleCycles<V,E>
Find all simple cycles of a directed graph using the Tarjan's algorithm.
See:
R. Tarjan, Enumeration of the elementary circuits of a directed graph, SIAM J. Comput., 2 (1973),
pp. 211-216.
- Author:
- Nikolay Ognyanov
-
Constructor Summary
Constructors Constructor Description TarjanSimpleCycles()
Create a simple cycle finder with an unspecified graph.TarjanSimpleCycles(Graph<V,E> graph)
Create a simple cycle finder for the specified graph. -
Method Summary
-
Constructor Details
-
TarjanSimpleCycles
public TarjanSimpleCycles()Create a simple cycle finder with an unspecified graph. -
TarjanSimpleCycles
Create a simple cycle finder for the specified graph.- Parameters:
graph
- - the DirectedGraph in which to find cycles.- Throws:
java.lang.IllegalArgumentException
- if the graph argument isnull
.
-
-
Method Details
-
getGraph
Get the graph- Returns:
- graph
-
setGraph
Set the graph- Parameters:
graph
- graph
-
findSimpleCycles
Find the simple cycles of the graph.- Specified by:
findSimpleCycles
in interfaceDirectedSimpleCycles<V,E>
- Returns:
- The list of all simple cycles. Possibly empty but never
null
.
-