Question

Prim algorithm and Dijkstra algorithm are similar: both are greedy algorithms, but a bit different. Using the following diagram and pseudocode, i) explain briefly how they differ using a few calculations and your own words ii) modify the red part in the following Prim algorithm's pseudocode so that it can be transformed to a Dijkstra algorithm. Notes: i. You don't need to show all calculation, just show only a small necessary part of the calculation to demonstrate how Prim and Dijkstra algorithms differ. ii. You must use the following diagram & pseudocode: 3 b a 1 5 2 4 1 3 d e f 2 Diagram 1

          Prim algorithm and Dijkstra algorithm are similar: both are greedy
algorithms, but a bit different.
Using the following diagram and pseudocode,
i) explain briefly how they differ using a few calculations and
your own words
ii) modify the red part in the following Prim algorithm's
pseudocode so that it can be transformed to a Dijkstra
algorithm.
Notes:
i.
You don't need to show all calculation, just show only a
small necessary part of the calculation to demonstrate how
Prim and Dijkstra algorithms differ.
ii. You must use the following diagram & pseudocode:
3
b
a
1
5
2
4
1
3
d
e
f
2
Diagram 1

Prim algorithm and Dijkstra algorithm are similar: both are greedy
algorithms, but a bit different.
Using the following diagram and pseudocode,
i) explain briefly how they differ using a few calculations and
your own words
ii) modify the red part in the following Prim algorithm's
pseudocode so that it can be transformed to a Dijkstra
algorithm.
Notes:
i.
You don't need to show all calculation, just show only a
small necessary part of the calculation to demonstrate how
Prim and Dijkstra algorithms differ.
ii. You must use the following diagram pseudocode:
3
b
a
1
5
2
4
1
3
d
e
f
2
Diagram 1

Added by Esther E.

Question

Please give Ace some feedback