org.apache.commons.graph.algorithm.path
Class AllPaths

java.lang.Object
  extended byorg.apache.commons.graph.algorithm.path.AllPaths

public class AllPaths
extends java.lang.Object


Field Summary
private  java.util.Map allPaths
           
private  AllPairsShortestPath apsp
           
private  DirectedGraph graph
           
 
Constructor Summary
AllPaths(DirectedGraph graph)
           
 
Method Summary
 void appendPaths(java.util.Set RC, java.util.Set iks, java.util.Set kjs)
           
 void findPaths(PathListener listener, Vertex i, Vertex j, int maxLength)
           
 java.util.Iterator findPaths(Vertex i, Vertex j)
           
 java.util.Set getAllPaths(Vertex i, Vertex j)
          Deprecated. Use findPaths instead. Doesn't work, but code may be useful in the near future.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

allPaths

private java.util.Map allPaths

apsp

private AllPairsShortestPath apsp

graph

private DirectedGraph graph
Constructor Detail

AllPaths

public AllPaths(DirectedGraph graph)
Method Detail

findPaths

public java.util.Iterator findPaths(Vertex i,
                                    Vertex j)

findPaths

public void findPaths(PathListener listener,
                      Vertex i,
                      Vertex j,
                      int maxLength)

getAllPaths

public java.util.Set getAllPaths(Vertex i,
                                 Vertex j)
Deprecated. Use findPaths instead. Doesn't work, but code may be useful in the near future.

getAllPaths will return the set of all possible ways of moving from i to j using the directed graph AllPaths was initialized with.


appendPaths

public void appendPaths(java.util.Set RC,
                        java.util.Set iks,
                        java.util.Set kjs)