Q. The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.

(A) true
(B) false
(C) ---
(D) ---

💬 Discuss

✅ Correct Answer: (B) false

Explanation: the number of iterations involved in bellmann ford algorithm is more than that of dijkstra’s algorithm.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:43 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

the number of iterations involved in bellmann ford algorithm is more than that of dijkstra’s algorithm.

💬 Discussion

📊 Question Analytics

👁️

687

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

95%

Success Rate