com.graphhopper.routing

Class Dijkstra

java.lang.Object

com.graphhopper.routing.AbstractRoutingAlgorithm

com.graphhopper.routing.Dijkstra

All Implemented Interfaces:

RoutingAlgorithm

public class Dijkstra
extends AbstractRoutingAlgorithm

Implements a single source shortest path algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm

Author:

Peter Karich

Field Summary

Fields

Modifier and Type	Field and Description
protected SPTEntry	currEdge
protected PriorityQueue<SPTEntry>	fromHeap
protected com.carrotsearch.hppc.IntObjectMap<SPTEntry>	fromMap

Fields inherited from class com.graphhopper.routing.AbstractRoutingAlgorithm

additionalEdgeFilter, flagEncoder, graph, inEdgeExplorer, maxVisitedNodes, nodeAccess, outEdgeExplorer, traversalMode, weighting

Constructor Summary

Constructors

Constructor and Description
Dijkstra(Graph graph, Weighting weighting, TraversalMode tMode)

Method Summary

Modifier and Type	Method and Description
Path	calcPath(int from, int to) Calculates the best path between the specified nodes.
protected Path	extractPath() To be overwritten from extending class.
protected boolean	finished() To be overwritten from extending class.
String	getName()
int	getVisitedNodes() Returns the visited nodes after searching.
protected void	initCollections(int size)
protected void	runAlgo()
protected void	updateBestPath(EdgeIteratorState edgeState, SPTEntry bestSPTEntry, int traversalId)

Methods inherited from class com.graphhopper.routing.AbstractRoutingAlgorithm

accept, calcPaths, checkAlreadyRun, createEmptyPath, isMaxVisitedNodesExceeded, setEdgeFilter, setMaxVisitedNodes, toString

Methods inherited from class java.lang.Object

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

Field Detail

fromMap

protected com.carrotsearch.hppc.IntObjectMap<SPTEntry> fromMap

fromHeap

protected PriorityQueue<SPTEntry> fromHeap

currEdge

protected SPTEntry currEdge

Constructor Detail

Dijkstra

public Dijkstra(Graph graph,
                Weighting weighting,
                TraversalMode tMode)

Method Detail

initCollections

protected void initCollections(int size)

calcPath

public Path calcPath(int from,
                     int to)

Description copied from interface: RoutingAlgorithm

Calculates the best path between the specified nodes.

Returns:

the path. Call the method found() to make sure that the path is valid.

runAlgo

protected void runAlgo()

finished

protected boolean finished()

Description copied from class: AbstractRoutingAlgorithm

To be overwritten from extending class. Should we make this available in RoutingAlgorithm interface?

Specified by:

finished in class AbstractRoutingAlgorithm

Returns:

true if finished.

extractPath

protected Path extractPath()

Description copied from class: AbstractRoutingAlgorithm

To be overwritten from extending class. Should we make this available in RoutingAlgorithm interface?

Specified by:

extractPath in class AbstractRoutingAlgorithm

Returns:

true if finished.

getVisitedNodes

public int getVisitedNodes()

Description copied from interface: RoutingAlgorithm

Returns the visited nodes after searching. Useful for debugging.

updateBestPath

protected void updateBestPath(EdgeIteratorState edgeState,
                              SPTEntry bestSPTEntry,
                              int traversalId)

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Overrides:

getName in class AbstractRoutingAlgorithm

Returns:

name of this algorithm