Recent questions tagged dijkstras-algorithm

0 votes
0 answers
31
Dijkstra Algo terminates and produce wrong result when graph contain negative wt CycleWhat about Belman Ford??and FloydWarshall???
0 votes
0 answers
32
Prove dijkstra’s algorithm using Heap is O((n+|E|)logn) where n is no.of vertices and |E| is number of edges?Book : Fundamentals of Computer Algorithms By sahni pa...
1 votes
0 answers
33
0 votes
1 answer
34
difference between Bellmann ford and dijkstra's algorithm for -ve weight cycle graph
0 votes
0 answers
35
0 votes
2 answers
36
I think the past cost to G from A as computed by Dijkstra should be 2 instead of 8.Please help me verify it.
0 votes
1 answer
37
Will dijkistra fail if a graph has negative weight cycle which is unreachable from source????
0 votes
1 answer
38
0 votes
0 answers
39
Why Decrease Key operation we do only on edges and Extract Min operation do only on vertices? (I mean why Decrease key cannot operate on both edges and vertices?)
0 votes
0 answers
40
0 votes
0 answers
42
What is meant by wrong path in Dijikstra's algo. Can anyone please explain
1 votes
0 answers
49
1 votes
3 answers
50
2 votes
1 answer
51
1 votes
1 answer
53
3 votes
0 answers
55
While going through dijkstra's algorithm, there is a term "decrease key". I am not getting the meaning when it says "we do decrease key operation". What exactly we do and...
7 votes
0 answers
56
1 votes
1 answer
57
What is cost of shortest path from S to T ?is any difference between when greedy method is used
0 votes
0 answers
58
How to solve this?
1 votes
3 answers
59
0 votes
0 answers
60