Timeline for Why doesn't Dijkstra's use a shortest-path first search?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 24, 2020 at 23:43 | vote | accept | del | ||
| Jan 24, 2020 at 23:42 | comment | added | del | Thank you for the excellent description! It makes sense to me now. | |
| Jan 20, 2020 at 21:10 | comment | added | John L. |
"Instead of choosing a random neighbour, why not always follow the neighbour with the shortest path?" Well, a better description of your algorithm is to follow the vertex in "the exploring front" with the shortest path. The exploring front consists of all vertices not in dictionary distance that are connected to vertices popped from the heap q. The step2 of stDA, could be implemented as setting the non-visited node in th exploring front with the smallest current distance as the current node C. Then your algorithm will almost be the same as the stDA.
|
|
| Jan 20, 2020 at 15:56 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation.
|
| Jan 20, 2020 at 15:51 | history | edited | John L. | CC BY-SA 4.0 |
Clearer explanation.
|
| Jan 20, 2020 at 8:48 | history | answered | John L. | CC BY-SA 4.0 |