Package com.savarese.algorithms.graph

Algorithms that operate on graphs.

See:
Description

Interface Summary

Graph<V,E extends Edge<V,?>>	A Graph is a collection of vertices and the edges emanating from them.
SingleSourcePath<V,W>	A SingleSourcePath represents a solution to a single source path finding problem, containing one path from a single source vertex to one or more destinations.
SingleSourcePathFinder<V,W,E extends Edge<V,W>>	A SingleSourcePathFinder is a path finding algorithm that finds paths between a single source and one or more destinations meeting some criteria (e.g., shortest path).

Class Summary

AdjacencyList<V,E extends Edge<V,?>>	An AdjacencyList represents a graph by mapping a set of vertices to the set of edges emanating from each vertex.
DijkstraShortestPathFinder<V,E extends Edge<V,java.lang.Integer>>	The DijkstraShortestPathFinder class implements Dijkstra's algorithm, which solves the single source shortest paths problem.
Edge<V,W>	An Edge represents a directed or undirected connection between two vertices with an associated weight.

Package com.savarese.algorithms.graph Description

Algorithms that operate on graphs. This package contains data structures and algorithms for manipulating graphs.