Implement unaccellerated Dijkstra as own algorithm

[TheMarex]

In order to be able to support more dynamic features, we need a routing algorithm without any pre-processing that is metric dependent. This gives us a dummy implementation we can use to implement advanced dynamic API features.

Since we have all the abstractions layers already in place, this is quite straight forward:

• Add a new algorithm https://github.com/Project-OSRM/osrm-backend/blob/master/include/engine/algorithm.hpp#L10-L26
• Add a new AlgorithmDataFacade that uses the MLD base graph
• Add a new implementation for Search() in routing_base.hpp

[chaupow]

Btw, this is a superb task for someone who likes shortest path algorithms and c++ and osrm and has not written a Dijkstra before....

well no, even if you have implemented Dijkstras already. You can never implement too many DIjkstras in life.

[github-actions[bot]]

This issue seems to be stale. It will be closed in 30 days if no further activity occurs.