hello,
regarding the following question:
"Verify that the Bellmann-Ford algorithm applied on G provides a correct solution, that is, the distance from s to any other vertex for all s ∈ V ."
what do we have to do exactly? is the question asking us to run the algorithm step by step from all sources and verify that the results are correct?
Thank you!
Giovanni