hopefully this is the right place, but can anybody please simply explain these two algorithms? or provide a viable source to which i can read about them.
I am not authoritative on this topic (and if someone who is expert will jump in that would be appreciated) but I wonder if the choice is based on Bellman Ford ability to handle situations where some of the edge weights are negative numbers (which Dijkstra does not do). See this article for further discussion:
Find answers to your questions by entering keywords or phrases in the Search bar above. New here? Use these resources to familiarize yourself with the community:
