HW9 - b. Is this minimum spanning tree unique? Why?

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Sheet1 Page 1 p.339 9.11 Find the maximum flow in the network of Figure 9.79. p.339 9.15 a. Find a minimum spanning tree for the graph in Figure 9.82 using both Prim's and Kruskal's algorithms.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b. Is this minimum spanning tree unique? Why?...
View Full Document

Ask a homework question - tutors are online