+1 vote
25 views
ago in Computer Networks by (user.guest)

1 Answer

+1 vote
ago by (user.guest)
selected ago by (user.guest)
 
Best answer

Some of the conditions for Dijkstra's algorithm to work include the following:

  • The must not contain any negative weight edge
  • It works for only connected graphs
  • The algorithm stops when every vertex is examined once 
  • It does not provide the shortest path, but rather the value.

Related questions

0 votes
1 answer 3 views
0 votes
1 answer 44 views
+1 vote
1 answer 593 views
0 votes
1 answer 1.4k views
0 votes
1 answer 125 views
0 votes
1 answer 81 views
0 votes
1 answer 37 views
+1 vote
1 answer 157 views
+1 vote
1 answer 120 views
0 votes
1 answer 32 views
0 votes
1 answer 160 views
+1 vote
1 answer 845 views
+1 vote
1 answer 1.7k views
+1 vote
1 answer 273 views
+2 votes
1 answer 2.5k views
+1 vote
1 answer 1.4k views
+1 vote
1 answer 198 views
+1 vote
1 answer 170 views
+1 vote
1 answer 184 views
+1 vote
2 answers 191 views
+1 vote
1 answer 97 views
+1 vote
1 answer 706 views
+1 vote
1 answer 1.2k views
+1 vote
1 answer 77 views
+1 vote
1 answer 66 views
+1 vote
1 answer 94 views
Welcome to CPENTalk.com
Solution-oriented students of computer engineering on one platform to get you that

ONE SOLUTION

...