java.lang.Object
org.jgrapht.alg.cycle.SzwarcfiterLauerSimpleCycles<V,E>
- Type Parameters:
V
- the vertex type.E
- the edge type.
- All Implemented Interfaces:
DirectedSimpleCycles<V,E>
public class SzwarcfiterLauerSimpleCycles<V,E> extends java.lang.Object implements DirectedSimpleCycles<V,E>
Find all simple cycles of a directed graph using the Schwarcfiter and Lauer's algorithm.
See:
J.L.Szwarcfiter and P.E.Lauer, Finding the elementary cycles of a directed graph in $O(n + m)$
per cycle, Technical Report Series, #60, May 1974, Univ. of Newcastle upon Tyne, Newcastle upon
Tyne, England.
- Author:
- Nikolay Ognyanov
-
Constructor Summary
Constructors Constructor Description SzwarcfiterLauerSimpleCycles()
Create a simple cycle finder with an unspecified graph.SzwarcfiterLauerSimpleCycles(Graph<V,E> graph)
Create a simple cycle finder for the specified graph. -
Method Summary
-
Constructor Details
-
SzwarcfiterLauerSimpleCycles
public SzwarcfiterLauerSimpleCycles()Create a simple cycle finder with an unspecified graph. -
SzwarcfiterLauerSimpleCycles
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
.
-