Uses of Interface
salvo.jesus.graph.WeightedGraph

Packages that use WeightedGraph

Package	Description
salvo.jesus.graph
salvo.jesus.graph.algorithm

Uses of WeightedGraph in salvo.jesus.graph

Classes in salvo.jesus.graph that implement WeightedGraph

Modifier and Type	Class and Description
class	WeightedGraphImpl An implementation of the WeightedGraph interface where all edges in the graph have a weight.

Methods in salvo.jesus.graph that return WeightedGraph

Modifier and Type	Method and Description
WeightedGraph	WeightedGraphImpl.minimumSpanningTree() Determine a minimum spanning tree for the weighted graph.
WeightedGraph	WeightedGraph.minimumSpanningTree() Determine a minimum spanning tree for the weighted graph.
WeightedGraph	WeightedGraphImpl.shortestPath(Vertex vertex) Determine a shortest path spanning tree for the weighted graph.
WeightedGraph	WeightedGraph.shortestPath(Vertex vertex) Determine a shortest path spanning tree for the weighted graph.

Uses of WeightedGraph in salvo.jesus.graph.algorithm

Methods in salvo.jesus.graph.algorithm that return WeightedGraph

Modifier and Type	Method and Description
WeightedGraph	MinimumSpanningTreeKruskalAlgorithm.minimumSpanningTree() Determine the minimum spanning tree of a weighted graph using Kruskal's method.
abstract WeightedGraph	MinimumSpanningTreeAlgorithm.minimumSpanningTree() Abstract method to be implemented by subclasses.
WeightedGraph	ShortestPathDijkstraAlgorithm.shortestPath(Vertex from) Determines the shortest path from a given vertex to all other vertices that are in the same connected set as the given vertex in the weighted graph using Dijkstra's algorithm.
abstract WeightedGraph	ShortestPathAlgorithm.shortestPath(Vertex from) Abstract method to be implemented by subclasses to determine a shortest path spanning tree from a given vertex in the form of a graph.

Constructors in salvo.jesus.graph.algorithm with parameters of type WeightedGraph

Constructor and Description
MinimumSpanningTreeAlgorithm(WeightedGraph wgraph)
MinimumSpanningTreeKruskalAlgorithm(WeightedGraph wgraph) Creates an instance of MinimumSpanningTreeKruskalAlgorithm
ShortestPathAlgorithm(WeightedGraph wgraph)
ShortestPathDijkstraAlgorithm(WeightedGraph wgraph, HeapNodeComparator comparator) Creates an instance of ShortestPathDijkstraAlgorithm.