Dijkstra’s algorithm is an algorithm for finding the shortest paths between two vertices in a network.
The weight of an edge sequence is given by:
where is a non-negative weight function, .
Algorithm: Let be the source vertex and be the sink vertex:
todo