info.debatty.java.graphs

Class Dijkstra<T>

java.lang.Object

info.debatty.java.graphs.Dijkstra<T>

Type Parameters:

T - type of nodes in the graph

public class Dijkstra<T>
extends Object

Compute the shortest path (measured as the number of 'hops' from this source node to every other node in the graph using Dijkstra algorithm.

Author:

Thibault Debatty

Constructor Summary

Constructors

Constructor and Description
Dijkstra(Graph graph, T source) Compute the shortest path from source node to every other node in the graph.

Method Summary

Modifier and Type	Method and Description
int	getLargestDistance() Return the distance (measured as the number of hops) to the most distant node.
LinkedList<T>	getPath(T target) Return the path from the source to the selected target.

Methods inherited from class java.lang.Object

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

Constructor Detail

Dijkstra

public Dijkstra(Graph graph,
                T source)

Compute the shortest path from source node to every other node in the graph.

Parameters:

graph - to use for computing path

source - node from which to compute distance to every other node

Method Detail

getPath

public final LinkedList<T> getPath(T target)
                            throws Exception

Return the path from the source to the selected target.

Parameters:

target - node to which we search the path

Returns:

the path from the source to the selected target

Throws:

Exception - if no path exists to this target

getLargestDistance

public final int getLargestDistance()

Return the distance (measured as the number of hops) to the most distant node.

Returns:

the distance (measured as the number of hops) to the most distant node