movement.map

Class DijkstraPathFinderOptimal

java.lang.Object

movement.map.DijkstraPathFinderOptimal

public class DijkstraPathFinderOptimal
extends java.lang.Object

Implementation of the Dijkstra's shortest path algorithm. Compute Dijkstra if necessary.

Constructor Summary

Constructors

Constructor and Description
DijkstraPathFinderOptimal(int[] okMapNodes) Constructor.

Method Summary

Methods

Modifier and Type	Method and Description
java.lang.Double	getShortestDistance(MapNode from, MapNode to) Return the distance between two map nodes, compute Dijkstra if necessary
java.util.List<MapNode>	getShortestPath(MapNode from, MapNode to) Finds and returns a shortest path between two map nodes
void	setHost(DTNHost host) Sets the host

Methods inherited from class java.lang.Object

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

Constructor Detail

DijkstraPathFinderOptimal

public DijkstraPathFinderOptimal(int[] okMapNodes)

Constructor.

Parameters:

okMapNodes - The map node types that are OK for paths or null if all nodes are OK

Method Detail

getShortestPath

public java.util.List<MapNode> getShortestPath(MapNode from,
                                      MapNode to)

Finds and returns a shortest path between two map nodes

Parameters:

from - The source of the path

to - The destination of the path

Returns:

a shortest path between the source and destination nodes in a list of MapNodes or an empty list if such path is not available

getShortestDistance

public java.lang.Double getShortestDistance(MapNode from,
                                   MapNode to)

Return the distance between two map nodes, compute Dijkstra if necessary

Parameters:

from - The source of the path

to - The destination of the path

Returns:

the minimal distance between the source and destination

setHost

public void setHost(DTNHost host)

Sets the host

Parameters:

host - Host