graph.algorithm.cycles

Class SimpleUndirectedCyclesFinder<V extends Vertex,E extends Edge<V>>

java.lang.Object

graph.algorithm.cycles.SimpleUndirectedCyclesFinder<V,E>

Type Parameters:

V - The vertex type

E - The edge type

public class SimpleUndirectedCyclesFinder<V extends Vertex,E extends Edge<V>>
extends java.lang.Object

Finds all cycles of a graph

Author:

Renata

Constructor Summary

Constructors

Constructor and Description
SimpleUndirectedCyclesFinder(Graph<V,E> graph)

Method Summary

Modifier and Type	Method and Description
java.util.List<java.util.List<V>>	findAllCycles() Finds all cycles of a graph.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SimpleUndirectedCyclesFinder

public SimpleUndirectedCyclesFinder(Graph<V,E> graph)

Method Detail

findAllCycles

public java.util.List<java.util.List<V>> findAllCycles()

Finds all cycles of a graph. A graph can have a very large number of cycles, and the algorithm is only effective if that is not the case.

Returns:

All cycles of a graph, where each cycles is represented as a list of vertices it contains