0.5 0.1 0.4 0.45 0.3 0.3 0.4 0.6

3) Consider an undirected version of the graph in problem 1 (in other words, ignore the arrows):
a) Using the same starting node as in problem 1, apply Kruskal’s algorithm for solving Minimum Spanning Trees. Is your solution unique?
*Tip: Use Figure 23.4 as a model
b) Again, using the same starting node as in problem 1, apply Prim’s algorithm for solving Minimum Spanning Trees. Is your solution unique?
*Tip: Use Figure 23.5 as a model

The graph is above one.

The above question is from below link

http://ce.bonabu.ac.ir/uploads/30/CMS/user/file/115/EBook/Introduction.to.Algorithms.3rd.Edition.Sep.2010.pdf

0.5 0.1 0.4 0.45 0.3 0.3 0.4 0.6



Source link

Leave a Reply

Your email address will not be published.