Vidyalelo
Data Structure · Q146

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 146

Q146

Bellmann Ford Algorithm is an example for . . . . . . . .

A.
Dynamic Programming
Answer
B.
Greedy Algorithms
C.
Linear Programming
D.
Branch and Bound

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board
PreviousNext
All Graph Algorithms (DFS, BFS, Dijkstras, etc) questions