|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.jgrapht.alg.cycle.PatonCycleBase<V,E>
V
- the vertex type.E
- the edge type.public class PatonCycleBase<V,E>
Find a cycle base of an undirected graph using the Paton's algorithm.
See:
Constructor Summary | |
---|---|
PatonCycleBase()
Create a cycle base finder with an unspecified graph. |
|
PatonCycleBase(UndirectedGraph<V,E> graph)
Create a cycle base finder for the specified graph. |
Method Summary | |
---|---|
List<List<V>> |
findCycleBase()
Finds a cycle base of the graph. Note that the full algorithm is executed on every call since the graph may have changed between calls. |
UndirectedGraph<V,E> |
getGraph()
Returns the graph on which the cycle base search algorithm is executed by this object. |
void |
setGraph(UndirectedGraph<V,E> graph)
Sets the graph on which the cycle base search algorithm is executed by this object. |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public PatonCycleBase()
public PatonCycleBase(UndirectedGraph<V,E> graph)
graph
- - the DirectedGraph in which to find cycles.
IllegalArgumentException
- if the graph argument is
null
.Method Detail |
---|
public UndirectedGraph<V,E> getGraph()
getGraph
in interface UndirectedCycleBase<V,E>
public void setGraph(UndirectedGraph<V,E> graph)
setGraph
in interface UndirectedCycleBase<V,E>
graph
- the graph.public List<List<V>> findCycleBase()
findCycleBase
in interface UndirectedCycleBase<V,E>
null
.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |