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

Packages that use WeightedGraph

org.apache.commons.graph.model	In-memory based data-structures implementations.
org.apache.commons.graph.shortestpath	Shortest Path algorithms implementations.
org.apache.commons.graph.spanning	Minimum spanning tree (forest) algorithms implementation.

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

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

class

DirectedMutableWeightedGraph<V extends Vertex,WE extends WeightedEdge<V>> A memory-based implementation of a mutable, directed weighted Graph.

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

Methods in org.apache.commons.graph.shortestpath with parameters of type WeightedGraph

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.

Uses of WeightedGraph in org.apache.commons.graph.spanning

Methods in org.apache.commons.graph.spanning with parameters of type WeightedGraph

static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Prim.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.
static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Kruskal.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.
static <V extends Vertex,WE extends WeightedEdge<V>> Graph<V,WE>	Boruvka.minimumSpanningTree(WeightedGraph<V,WE> graph) Calculates the minimum spanning tree (or forest) of the input Graph.