Package graphs

Interface Summary

Interface	Description
AStarGraph<V>	Directed, edge-weighted graph with a heuristic function to estimate distances between vertices.
Graph<V>	Directed, edge-weighted graph.
ShortestPathSolver<V>	Single-source shortest paths from a start defined in Constructor#run(Graph, V) to all reachable vertices.
ShortestPathSolver.Constructor<V>	Constructor for ShortestPathSolver.

Class Summary

Class	Description
AStarSolver<V>	A* search implementation for single-pair shortest paths in an AStarGraph.
DijkstraSolver<V>	Dijkstra's algorithm implementation of the ShortestPathSolver interface.
Edge<V>	Weighted, directed edge.
ToposortDAGSolver<V>	Topological sorting implementation of the ShortestPathSolver interface for directed acyclic graphs.