Start learning 50% faster. Sign in now
The Bellman-Ford Algorithm (C) is best suited for finding the shortest path in graphs that may have negative weights but no negative cycles. It works by relaxing the edges up to (V-1) times, where V is the number of vertices, ensuring it can handle negative weights and detect negative cycles. Why Other Options Are Wrong: A) Dijkstra's Algorithm: Dijkstra’s algorithm is faster than Bellman-Ford for graphs with non-negative weights but fails when negative weights are present, as it assumes all edge weights are positive. B) Kruskal's Algorithm: This is a Minimum Spanning Tree (MST) algorithm used to connect all nodes in a graph with minimum weight, not to find the shortest path between two nodes. D) Prim’s Algorithm: Like Kruskal’s, Prim’s algorithm is used for finding an MST, not for finding the shortest path in a graph with negative weights. E) Floyd-Warshall Algorithm: This algorithm computes shortest paths between all pairs of vertices and works for both positive and negative weights, but it is not optimal for solving single-source shortest path problems.
India is the second Largest Producer of Rice Globally with a record rice production in 2021-22 is about ……………………..
...Recently, the Ministry of Commerce and Industry announced that the first consignment of organic millets would be exported to………………………...
Arrange the following states in ascending order on the basis of their forest cover area.
I. Madhya Pradesh
II. Chhattisgarh
III....
Which is not a type of elements ?
Which of the following organizations have launched the "Kritagya (Krishi-Raknik-Gyan) Hackathon"?
World Animal Day is observed 4th October every year and the theme for the same during this year was
Brinjal is a good source of which element?
As per Climate Change Performance Index 2023 ( CCPI, 2023) India is the only G-20 country in the top 10 ranks. The first three ranks in the overall ...
Which Indian state produces the largest quantity of pulses?
Green Revolution in India was primarily associated with crops?