com.graphhopper.routing

Class AbstractRoutingAlgorithm

java.lang.Object

com.graphhopper.routing.AbstractRoutingAlgorithm

All Implemented Interfaces:

RoutingAlgorithm

Direct Known Subclasses:

AStar, Dijkstra, DijkstraOneToMany, ShortestPathTree

public abstract class AbstractRoutingAlgorithm
extends Object
implements RoutingAlgorithm

Author:

Peter Karich

Field Summary

Fields

Modifier and Type	Field and Description
protected EdgeExplorer	edgeExplorer
protected Graph	graph
protected int	maxVisitedNodes
protected NodeAccess	nodeAccess
protected TraversalMode	traversalMode
protected Weighting	weighting

Constructor Summary

Constructors

Constructor and Description
AbstractRoutingAlgorithm(Graph graph, Weighting weighting, TraversalMode traversalMode)

Method Summary

Modifier and Type	Method and Description
protected boolean	accept(EdgeIteratorState iter, int prevOrNextEdgeId)
List<Path>	calcPaths(int from, int to) Calculates multiple possibilities for a path.
protected void	checkAlreadyRun()
protected Path	createEmptyPath()
protected abstract Path	extractPath() To be overwritten from extending class.
protected abstract boolean	finished() To be overwritten from extending class.
String	getName()
protected boolean	isMaxVisitedNodesExceeded()
void	setMaxVisitedNodes(int numberOfNodes) Limit the search to numberOfNodes.
String	toString()

Methods inherited from class java.lang.Object

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

Methods inherited from interface com.graphhopper.routing.RoutingAlgorithm

calcPath, getVisitedNodes

Field Detail

graph

protected final Graph graph

weighting

protected final Weighting weighting

traversalMode

protected final TraversalMode traversalMode

nodeAccess

protected final NodeAccess nodeAccess

edgeExplorer

protected final EdgeExplorer edgeExplorer

maxVisitedNodes

protected int maxVisitedNodes

Constructor Detail

AbstractRoutingAlgorithm

public AbstractRoutingAlgorithm(Graph graph,
                                Weighting weighting,
                                TraversalMode traversalMode)

Parameters:

graph - specifies the graph where this algorithm will run on

weighting - set the used weight calculation (e.g. fastest, shortest).

traversalMode - how the graph is traversed e.g. if via nodes or edges.

Method Detail

setMaxVisitedNodes

public void setMaxVisitedNodes(int numberOfNodes)

Description copied from interface: RoutingAlgorithm

Limit the search to numberOfNodes. See #681

Specified by:

setMaxVisitedNodes in interface RoutingAlgorithm

accept

protected boolean accept(EdgeIteratorState iter,
                         int prevOrNextEdgeId)

checkAlreadyRun

protected void checkAlreadyRun()

finished

protected abstract boolean finished()

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

Returns:

true if finished.

extractPath

protected abstract Path extractPath()

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

Returns:

true if finished.

calcPaths

public List<Path> calcPaths(int from,
                            int to)

Description copied from interface: RoutingAlgorithm

Calculates multiple possibilities for a path.

Specified by:

calcPaths in interface RoutingAlgorithm

See Also:

RoutingAlgorithm.calcPath(int, int)

createEmptyPath

protected Path createEmptyPath()

getName

public String getName()

Specified by:

getName in interface RoutingAlgorithm

Returns:

name of this algorithm

toString

public String toString()

Overrides:

toString in class Object

isMaxVisitedNodesExceeded

protected boolean isMaxVisitedNodesExceeded()