Question:
Which algorithm is used for finding the shortest path in a weighted graph with negative edges?
Which algorithm is used for finding the shortest path in a weighted graph with negative edges?
Show Hint
Choose Bellman-Ford for graphs with negative weights; Dijkstra’s for non-negative weights.
Updated On: Jun 18, 2025
- Bellman-Ford
- Dijkstra’s
- Kruskal’s
- Prim’s
Show Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
- Bellman-Ford algorithm handles graphs with negative edge weights and detects negative cycles, with time complexity $O(VE)$.
- Dijkstra’s algorithm fails with negative weights, requiring non-negative edges.
- Kruskal’s and Prim’s are for minimum spanning trees, not shortest paths.
Option (1) is correct.
- Dijkstra’s algorithm fails with negative weights, requiring non-negative edges.
- Kruskal’s and Prim’s are for minimum spanning trees, not shortest paths.
Option (1) is correct.
Was this answer helpful?
0
0
Top TS PGECET Computer Science & Information Technology Questions
- The transition a pushdown automation made by is additionally dependent upon
- Moore machine is an example of
- For a machine to surpass all the letters of alphabets excluding vowels, how many states in DFA would be required?
- A language $L$ is said to be Turing machine (TM) decidable if
- A Turing machine that is able to simulate other Turing machines is known as
View More Questions
Top TS PGECET Computer Languages and Algorithms Questions
- Given an array $A = \{15, 23, 27, 32, 45, 49, 60\}$ and key = 49, what are the mid values (corresponding array elements) in the first and second levels of recursion?
- What is the best case time complexity for linear search?
- How many solutions are there for the 8-Queen problem on an $8 \times 8$ chessboard?
- Which among the following is an external sorting technique?
- How many passes does an insertion sort algorithm take for sorting an array of ‘n’ elements?
View More Questions
Top TS PGECET Questions
- If \( P = \begin{pmatrix} 1 & 1 & 1 \\ 0 & 1 & 2 \\ 0 & 0 & 1 \end{pmatrix} \) is the modal matrix of \( A = \begin{pmatrix} 1 & 1 & 0 \\ 0 & 2 & 2 \\ 0 & 0 & 3 \end{pmatrix} \) then the sum of all the elements of \( P^{-1}AP \) is
- If the system of equations \( kx + y + z = k - 1 \), \( x + ky + z = k - 1 \), and \( x + y + kz = k - 1 \) has infinite solutions, then \( k \) is
- The value of the integral \( \int_C (2xy - x^2) \, dx + (x^2 + y^2) \, dy \) where \( C \) is the boundary of the region enclosed by \( y = x^2 \) and \( y^2 = x \), described in the positive sense, is
- Let \( f(x) = \log x \). The number \( C \) strictly between \( e^2 \) and \( e^3 \) such that its reciprocal is equal to \( \frac{f(e^3) - f(e^2)}{e^3 - e^2} \) is
- The solution of the differential equation \( (D^2 + 2)y = x^2 \) is
View More Questions