Content deleted Content added
typo |
|||
Line 34:
:To better approximate the actual algorithm, would you suggest rewriting Step 3 to be on the lines of "Select the unvisited node with the smallest distance to be the current node", remove the sentence from Step 2, and make Step 5 simply say "Go back to Step 3"?
:With this structure, you could justify the points you made in step 4 much more concisely, rather than long proof sketches which refer to the next step. [[User:IntGrah|IntGrah]] ([[User talk:IntGrah|talk]]) 12:46, 29 May 2024 (UTC)
::Your suggestions sound sensible to me. (Indeed I was trying to limit myself in the number of points changed, concerned that this would spark contention from many contributors that I would not be able to address, but collaboratively a change like this could be viable.)
::Perhaps I would still add something like I wrote in bold here: "Select the unvisited node with the smallest distance to be the current node '''(on the first entry to this step, this is the ''starting node'' of distance zero)'''", just to make it easy to think about how the algorithm first engages the state, yet reaffirm that this is a universal instruction that handles all cases. Will leave it up to you though. [[User:Zlamma|Zlamma]] ([[User talk:Zlamma|talk]]) 13:35, 29 May 2024 (UTC)
| |||