|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
V
- the vertex type.E
- the edge type.public interface DirectedSimpleCycles<V,E>
A common interface for classes implementing algorithms for enumeration of the simple cycles of a directed graph.
Method Summary | |
---|---|
List<List<V>> |
findSimpleCycles()
Finds the simple cycles of the graph. Note that the full algorithm is executed on every call since the graph may have changed between calls. |
DirectedGraph<V,E> |
getGraph()
Returns the graph on which the simple cycle search algorithm is executed by this object. |
void |
setGraph(DirectedGraph<V,E> graph)
Sets the graph on which the simple cycle search algorithm is executed by this object. |
Method Detail |
---|
DirectedGraph<V,E> getGraph()
void setGraph(DirectedGraph<V,E> graph)
graph
- the graph.
IllegalArgumentException
- if the argument is null
.List<List<V>> findSimpleCycles()
null
.
IllegalArgumentException
- if the current graph is null.
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |