ol-ext: Dijkstra short path

Loading data...

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:

The graph used in this example is ROUTE 120®, an opensource (Open licence) database from IGN-France.


Click points on the map!