Revision as of 03:46, 24 November 2023 edit 125.239.41.100 (talk) No edit summary ← Previous edit		Revision as of 03:47, 24 November 2023 edit undo SineBot (talk \| contribs) Bots 2,564,713 edits m Signing comment by 125.239.41.100 - "" Next edit →
Line 42: the algorithm tries to relax all edges for every edge on the shortest path - followingly, only size(vertices) - 1 relax-iterations have to be computed. As for what '''u''' is supposed to be, '''(u, v)''' is the entire edge, starting at vertex '''u''' and finishing at vertex '''v'''. <!-- Template:Unsigned IP --><small class="autosigned">— Preceding [[Wikipedia:Signatures\|unsigned]] comment added by [[Special:Contributions/125.239.41.100\|125.239.41.100]] ([[User talk:125.239.41.100#top\|talk]]) 03:46, 24 November 2023 (UTC)</small> <!--Autosigned by SineBot--> == Pop up shortest-path figure ==

Talk:Bellman–Ford algorithm: Difference between revisions