salvo.jesus.graph.algorithm

Class ShortestPathDijkstraAlgorithm

java.lang.Object

salvo.jesus.graph.algorithm.ShortestPathAlgorithm

salvo.jesus.graph.algorithm.ShortestPathDijkstraAlgorithm

All Implemented Interfaces:

Serializable

public class ShortestPathDijkstraAlgorithm
extends ShortestPathAlgorithm

A concrete implementation of ShortestPathAlgorithm using Dijkstra's method.

Author:

Jesus M. Salvo Jr.

See Also:

Serialized Form

Constructor Summary

Constructors

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

Method Summary

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

Methods inherited from class java.lang.Object

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

Constructor Detail

ShortestPathDijkstraAlgorithm

public ShortestPathDijkstraAlgorithm(WeightedGraph wgraph,
                                     HeapNodeComparator comparator)

Creates an instance of ShortestPathDijkstraAlgorithm.

Parameters:

wgraph - The WeightedGraph where a shortest path spanning tree will be determined.

comparator - The HeapNodeComparator to be used to compare priorities of objects in the fringe/heap.

Method Detail

shortestPath

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

Specified by:

shortestPath in class ShortestPathAlgorithm

Parameters:

from - The Vertex from where we want to obtain the shortest path to all other vertices.

Returns:

A WeightedGraph comprising of the shortest path spanning tree.