The most optimal Dijkstra's algorithm in python
Parameters :
- dict graphe : graph on which we wish to apply the algorithm.
- *a start_vertex : starting vertex of the type contained in the graph
Returns :
- dict D : dictionary associating a vertex and its distance from the initial vertex.
- dict V : dictionary associating a vertex and its parent vertex in the shortest path between it and the initial vertex.