Computer Science · Graph Algorithms
Given a weighted directed graph G with 'n' vertices and 'm' edges, the Bellman-Ford algorithm computes the shortest distance from a single source vertex 'v' to all other vertices in G in which of the following time complexities?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(n + m)
- 2O(n2)
- 3O(m2)
- 4O(n × m)✓
Correct answer
O(n × m)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Graph Algorithms MCQs →Want more practice questions on Graph Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Graph Algorithms