as2c - implement dealing with connected components. Give...

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

View Full Document Right Arrow Icon
1 CS/SE 2C03 NEW VERSION OF QUESTION 7b OF ASSIGNMENT 2 7. In the graph above replace arrows by lines, i.e. translate it into a graph which is not directed. Assume ordering as in 4.b. a. Find a minimum-cost spanning tree by Prim’s algorithm. b. Find a minimum-cost spanning tree by Kruskal’s algorithm. Use Union-Find abstract data type, merging smaller tree to the larger one and path compression to
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: implement dealing with connected components. Give all steps. c. Forget about weights and find a depth-first spanning tree starting at a . d. Forget about weights and find a breadth-first spanning tree starting at a. Give all steps....
View Full Document

This note was uploaded on 02/22/2011 for the course CS 1112 taught by Professor Dr.d during the Fall '11 term at McMaster University.

Ask a homework question - tutors are online