recategorized
2,573 views

2 Answers

3 votes
3 votes

Option D.

  1. Prim's algorithm = Min Cost spanning tree
  2. Floys-Warshall algorithm = All pair shortest path
  3. Johnson's algorithm =  All pair shortest path
  4. Dijkstra's algorithm = Single source shortest path

    Remember : 
    Bellman - Ford = Single source shortest path

Related questions

1 votes
1 votes
3 answers
1
Pooja Khatri asked Jul 13, 2018
3,343 views
Consider the array A=<4, 1, 3, 2, 16, 9, 10, 14, 8, 7>. After building heap from the array A, the depth of the heap and the right child of max-heap are ______ and _____ r...
0 votes
0 votes
2 answers
2
Pooja Khatri asked Jul 13, 2018
8,889 views
A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the ...
0 votes
0 votes
8 answers
3
2 votes
2 votes
3 answers
4
Pooja Khatri asked Jul 13, 2018
17,107 views
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450