me.jaimegarza.syntax.graph

Class DijkstraShortestPath<T extends Node>

java.lang.Object

me.jaimegarza.syntax.graph.DijkstraShortestPath<T>

Type Parameters:

T - is the type of node

public class DijkstraShortestPath<T extends Node>
extends Object

Implementation of the Dijkstra Shortest Path algorithm with the addition that it computes distances for all source nodes. We also consider all paths to have a weight=1 since we are using it for layout algorithms.

For this matter, distTo is an array of arrays whose first index is s.

I have based my algorithm on Algorithms, 4e, Sedgewick and Wayne, plus notes from other lectures.

Author:

jgarza

Constructor Summary

Constructors

Constructor and Description
DijkstraShortestPath(DirectedGraph<T> graph) Construct AND compute the shortest paths for a given graph.

Method Summary

Modifier and Type	Method and Description
protected void	compute(int s)
double[][]	getDistances()
double[][]	getDistTo()
Transition[][]	getEdgeTo()
double	getMaxDist()
Node[][]	getPred()
static void	main(String[] args)
protected void	relax(int s, me.jaimegarza.syntax.graph.DijkstraShortestPath.PQ elem)
String	toString()

Methods inherited from class java.lang.Object

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

Constructor Detail

DijkstraShortestPath

public DijkstraShortestPath(DirectedGraph<T> graph)

Construct AND compute the shortest paths for a given graph.

Parameters:

graph - is the graph in question

Method Detail

getDistances

public double[][] getDistances()

compute

protected void compute(int s)

relax

protected void relax(int s,
                     me.jaimegarza.syntax.graph.DijkstraShortestPath.PQ elem)

toString

public String toString()

Overrides:

toString in class Object

main

public static void main(String[] args)

getDistTo

public double[][] getDistTo()

Returns:

the distTo

getEdgeTo

public Transition[][] getEdgeTo()

Returns:

the edgeTo

getPred

public Node[][] getPred()

Returns:

the pred

getMaxDist

public double getMaxDist()

Returns:

the maxDist