Module org.jgrapht.core

Package org.jgrapht.alg.cycle

Class TarjanSimpleCycles<V,E>

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 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

Modifier and Type	Method	Description
void	findSimpleCycles(Consumer<List<V>> consumer)	Find the simple cycles of the graph.
Graph<V,E>	getGraph()	Get the graph
void	setGraph(Graph<V,E> graph)	Set the graph

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

TarjanSimpleCycles

public TarjanSimpleCycles()

Create a simple cycle finder with an unspecified graph.

TarjanSimpleCycles

public TarjanSimpleCycles(Graph<V,E> graph)

Create a simple cycle finder for the specified graph.

Parameters:

graph - - the DirectedGraph in which to find cycles.

Throws:

IllegalArgumentException - if the graph argument is null.

Method Details

getGraph

public Graph<V,E> getGraph()

Get the graph

Returns:

graph

setGraph

public void setGraph(Graph<V,E> graph)

Set the graph

Parameters:

graph - graph

findSimpleCycles

public void findSimpleCycles(Consumer<List<V>> consumer)

Find the simple cycles of the graph.

Specified by:

findSimpleCycles in interface DirectedSimpleCycles<V,E>

Parameters:

consumer - Consumer that will be called with each cycle found.