Consider the following Directed Acrylic Graph.
a) Find a minimum spanning tree for the given graph using
both Prim’s and Kruskal’s algorithms, implement using priority
queue in C++.
b) Is this minimum spanning tree unique? Why?
c) Compare the complexity analysis of both the methods and
explain
2
2
A
B
3
2
4
4
3
3
3
D
E
F
1
4
6
6
H
