GenericDijkstra (OpenTripPlanner 1.4.0 API)

```
public class GenericDijkstra
extends Object
```
Find the shortest path between graph vertices using Dijkstra's algorithm. TODO do we need this since we have GenericAStar and trivial remaining weight heuristic? It is used in pruning Area edges and in finding the distance to transit stops.

Fields
Modifier and Type	Field and Description
`SearchTerminationStrategy`	`searchTerminationStrategy`
`SkipEdgeStrategy`	`skipEdgeStrategy`
`SkipTraverseResultStrategy`	`skipTraverseResultStrategy`
`TraverseVisitor`	`traverseVisitor`

Constructors
Constructor and Description
`GenericDijkstra(RoutingRequest options)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`ShortestPathTree`	`getShortestPathTree(State initialState)`
`void`	`setHeuristic(RemainingWeightHeuristic heuristic)`
`void`	`setSearchTerminationStrategy(SearchTerminationStrategy searchTerminationStrategy)`
`void`	`setSkipEdgeStrategy(SkipEdgeStrategy skipEdgeStrategy)`
`void`	`setSkipTraverseResultStrategy(SkipTraverseResultStrategy skipTraverseResultStrategy)`

public SearchTerminationStrategy searchTerminationStrategy

public SkipEdgeStrategy skipEdgeStrategy

public SkipTraverseResultStrategy skipTraverseResultStrategy

public GenericDijkstra(RoutingRequest options)

public void setSearchTerminationStrategy(SearchTerminationStrategy searchTerminationStrategy)

public void setSkipEdgeStrategy(SkipEdgeStrategy skipEdgeStrategy)

public void setSkipTraverseResultStrategy(SkipTraverseResultStrategy skipTraverseResultStrategy)

public ShortestPathTree getShortestPathTree(State initialState)

public void setHeuristic(RemainingWeightHeuristic heuristic)

Class GenericDijkstra