1,051 views

1 Answer

Best answer
7 votes
7 votes
Why dijkastra provide wrong result for -ve edge. Because dijkastra supports increments of distance, when it goes from one vertex to other. In the middle if we get some -ve edge, this assumption will be violated. That is why dijkastra gives incorrect result for some cases.

Dijkastra doesnot check if there is a -ve edge or not. If it's assumtion is true, dijkastra even give correct result with -ve weight edges too.
selected by

Related questions

6 votes
6 votes
1 answer
1
vaishali jhalani asked Nov 5, 2016
3,000 views
What is the time complexity of Dijkstra’s algorithm if it is implemented using AVL Tree instead of Priority Queue over a graph G = (V, E)?
13 votes
13 votes
3 answers
4
go_editor asked Jun 10, 2016
5,099 views
Djikstra’s algorithm is used toCreate LSAsFlood an internet with informationCalculate the routing tablesCreate a link state database