Vidyalelo
Data Structure · Q73

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 73

Q73

Dijikstra's Algorithm is more efficient than Bellmann Ford Algorithm.

A.
True
Answer
B.
False

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