The Gateway to Computer Science Excellence

+4 votes

Yes. It works in dynamic programming approach.

- It calculates shortest paths in bottom-up manner.
- Intermediate values are stored and used for next level values.
- It first calculates the shortest distances for the shortest paths which have at-most one edge in the path. Stores it.
- Then, it calculates shortest paths with at-most 2 edges, and so on.
- After the i
^{th}iteration of outer loop, the shortest paths with at most i edges are calculated.

Hence it follows Dynamic programming approach

For more details , please refer : http://www.geeksforgeeks.org/dynamic-programming-set-23-bellman-ford-algorithm/

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,370 answers

198,506 comments

105,272 users