java.lang.Object
org.jgrapht.alg.cycle.TiernanSimpleCycles<V,E>
- Type Parameters:
V
- the vertex type.E
- the edge type.
- All Implemented Interfaces:
DirectedSimpleCycles<V,
E>
Find all simple cycles of a directed graph using the Tiernan's algorithm.
See:
J.C.Tiernan An Efficient Search Algorithm Find the Elementary Circuits of a Graph.,
Communications of the ACM, vol.13, 12, (1970), pp. 722 - 726.
- Author:
- Nikolay Ognyanov
-
Constructor Summary
ConstructorDescriptionCreate a simple cycle finder with an unspecified graph.TiernanSimpleCycles
(Graph<V, E> graph) Create a simple cycle finder for the specified graph. -
Method Summary
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
Methods inherited from interface org.jgrapht.alg.cycle.DirectedSimpleCycles
findSimpleCycles
-
Constructor Details
-
TiernanSimpleCycles
public TiernanSimpleCycles()Create a simple cycle finder with an unspecified graph. -
TiernanSimpleCycles
Create a simple cycle finder for the specified graph.- Parameters:
graph
- - the DirectedGraph in which to find cycles.- Throws:
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> - Parameters:
consumer
- Consumer that will be called with each cycle found.
-