Package helix.graph.algo

Interface Summary
Generator  
RandomGenerator  
Visitor  
 

Class Summary
AbstractCCVisitor a basic skeleton for a Visitor following the connected components (CC) of a graph note: you basically need to implement your own enter(), exit() and visit(Vertex v) methods enter() is called when entering a new CC exit() is called when finishing the current CC visit(v) is called when adding v into the current CC in addition you may override the accept(Edge edge) method to select proper edges (by default all existing edges are acceptable)
AbstractRandomGenerator  
BasicGenerator  
CCVisitor  
CircleGenerator  
Cloner a class to duplicate graphs or parts of graph
ComponentsFinder a class to compute connected components.
DeltaClosure  
DeltaClosure.Constraint class to define edge constraint
Dijkstra Dijkstra's algorithm solves the single-source shortest path problem note1 : this implementation is O(V2 + E) i.e does not use a priority queue note2: Dijkstra's algorithm is only useful if you want the shortest path from one source.
ErdosGenerator  
StarGenerator  
TestDeltaClosure  
TestWarshall  
Warshall