Revision as of 00:17, 31 December 2020 edit Lowercase sigmabot III (talk \| contribs) Bots, Page movers 2,448,799 edits m Archiving 2 discussion(s) to Talk:Dijkstra's algorithm/Archive 2) (bot ← Previous edit		Revision as of 16:22, 25 May 2022 edit undo 2001:569:57b2:4d00:71e1:a843:c41:841c (talk) →Roads and intersections: new section Next edit →
Line 44: Should we replace the condition with k == d[u]? —[[User:Enervation\|Enervation]] ([[User talk:Enervation\|talk]]) 16:44, 30 December 2020 (UTC) == Roads and intersections == Article says that "Note: For ease of understanding, this discussion uses the terms intersection, road and map – however, in formal terminology these terms are vertex, edge and graph, respectively." This...doesn't make it easier. It actually sounds incredibly patronizing. Who in the right mind would try to learn Dijkstra's algorithm without knowing what a vertex is? [[Special:Contributions/2001:569:57B2:4D00:71E1:A843:C41:841C\|2001:569:57B2:4D00:71E1:A843:C41:841C]] ([[User talk:2001:569:57B2:4D00:71E1:A843:C41:841C\|talk]]) 16:22, 25 May 2022 (UTC)

Talk:Dijkstra's algorithm: Difference between revisions