Dijkstra's algorithm
the proof of Dijstra algorithm is false and rejected, and the disproof of algorithm is by counter example
in the following modified dikjstra graph according to algorithm
the shortest path (1) -> (2) -> (3) -> (6) -> (5)
weight of path is 7 + 10 + 10 + 19 = 46
while the real shortest path is
(1)) -> (2) -> (4) -> (5)
with weight
7 + 11 + 1 = 19
and it's shorted in edges as well
dijkstra 4 and real shortest 3