File talk:Bellman–Ford algorithm example.gif

Should the values at the nodes always go lower? ( not like the gif?)--Couposanto (talk) 05:17, 16 December 2021 (UTC)

I was confused with Dijkstra algo, it does look like if the algo is visiting nodes instead sending information to neighbour.--Couposanto (talk) 05:17, 16 December 2021 (UTC)

Hey all, True, there was an error in the last frame. I updated the image: change the example + better quality.--Michel Bakni (talk) 10:53, 7 July 2022 (UTC)