Comments on: Computer Algorithms: Dijkstra Shortest Path in a Graph

By: Matt Skelton

Matt Skelton — Tue, 09 Jan 2018 15:22:37 +0000

I’m in agreement with Gab but I’m pretty sure I misunderstood something too. The shortest path is [0, 2, 3, 4, 5]. What am I missing?

By: Gab

Gab — Wed, 02 Sep 2015 09:39:55 +0000

I think the code implementation is wrong.

It says [0, 1, 2, 4, 5] is the shortests path. If we sum all distances between these vertices:
3+7+12+3 = 25
If we follow the second path [0,3,2,4,5] and sum all distances between these vertices:
1+8+12+3 = 24

I might have misunderstood something. Could anyone enlighten me please if I’m wrong?

Thanks,

Gab

By: Florian

Florian — Mon, 03 Nov 2014 15:39:42 +0000

Hi,

Thanks a lot for this tutorial and your very clear explanations.

At the end of your code, your give arguments $v0 and $adjacencyList to the function calcShortestPaths(). I was wondering how to display the shortest path that the function calcShortestPaths() computes (beginner in PHP)?

Thanks a lot for your kind help,

Florian

By: Mike

Mike — Sun, 06 Jul 2014 03:32:09 +0000

Pretty cool, but I have some concerns about the code:

– The vertex parent field doesn’t seem to get used here.
– Are you supposed to update the path every time you visit a neighboring node, or just when you adjust it’s distance ?
– Does recoverFromCorruption() delete duplicates and trigger a re-sort ? Seems like it would have to.

Thanks.

By: payal

payal — Mon, 06 May 2013 03:37:18 +0000

(y)