The ol/graph/Dijkstra use the
Dijkstra's algorithm
for finding the shortest paths between nodes in a ol/source/Vector (with LineString geometry features).
It uses a A* optimisation.
You can overwrite methods to customize the result:
- getLength() method enable you to specify an other distance calculation.
- weight() method enable weighting on the graph, for example calculate a speed factor on the edges.
- direction() method can defined the direction of the edges (-1, 0, 1 or 2).
The graph used in this example is ROUTE 120®,
an opensource (Open licence) database from IGN-France.