Uses of Interface
org.apache.commons.graph.WeightedPath

Packages that use WeightedPath

org.apache.commons.graph.model	In-memory based data-structures implementations.
org.apache.commons.graph.shortestpath	Shortest Path algorithms implementations.

Uses of WeightedPath in org.apache.commons.graph.model

Classes in org.apache.commons.graph.model that implement WeightedPath

class

InMemoryPath<V extends Vertex,WE extends WeightedEdge<V>> Support WeightedPath implementation, optimized for algorithms (such Dijkstra's) that need to rebuild the path traversing the predecessor list bottom-up.

Uses of WeightedPath in org.apache.commons.graph.shortestpath

Methods in org.apache.commons.graph.shortestpath that return WeightedPath

static <V extends Vertex,WE extends WeightedEdge<V>> WeightedPath<V,WE>

Dijkstra.findShortestPath(WeightedGraph<V,WE> graph, V source, V target) Applies the classical Dijkstra algorithm to find the shortest path from the source to the target, if exists.