Package com.gengoai.graph.algorithms

Interface Summary Interface Description GraphSearch<V> Searches for a path between a given starting point and given ending point.GraphTraversal<V> Defines an iterator from a starting vertex to traverse the graph.ShortestPath<V> Calculates the shortest path between two vertices.SingleSourceShortestPath<V> A shortest path interface that calculates the path for a single vertex to all other vertices in the graph. 
Class Summary Class Description AbstractGraphTraversal<V> Abstract traversal for depth first and breadth first traversalsBreadthFirstSearch<V> Performs a breadth first search to find a path between the given starting point and ending point.BreadthFirstTraversal<V> Traverses the graph in a breadth first fashion.DepthFirstSearch<V> Performs a depth first search to find a path between the given starting point and ending point.DepthFirstTraversal<V> Traverses the graph in a depth first fashion.DijkstraShortestPath<V> Implementation of Dijkstra's algorithm for finding the shortest paths between vertices in a graph.RandomWalk<V> Performs a random walk over the vertices in the graph.