salvo.jesus.graph.algorithm

Class ShortestPathAlgorithm

java.lang.Object

salvo.jesus.graph.algorithm.ShortestPathAlgorithm

All Implemented Interfaces:

Serializable

Direct Known Subclasses:

ShortestPathDijkstraAlgorithm

public abstract class ShortestPathAlgorithm
extends Object
implements Serializable

Abstract class for implementing the shortest path algorithm. A shortest path spanning tree is a subgraph of the original weighted graph showing how to reach all other vertices from a given vertex in the same connected set in the shortest possible way. The shortest path between two vertices should be such that the sum of the weights of all the edges between the two vertices be at a minimum. Note that, like minimum spanning trees, there may be more than one shortest spanning tree for a single weighted graph. Concrete subclasses must never modify the weighted graph where it is computing the shortestpath.

Author:

Jesus M. Salvo Jr.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
ShortestPathAlgorithm(WeightedGraph wgraph)

Method Summary

Modifier and Type	Method and Description
abstract WeightedGraph	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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ShortestPathAlgorithm

public ShortestPathAlgorithm(WeightedGraph wgraph)

Method Detail

shortestPath

public abstract WeightedGraph 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.

Returns:

A new WeightedGraph that represents the shortest path spanning tree of the original WeightedGraph. Do not modify the contents of the returned WeightedGraph.