{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Assignment 04 - Prim 1_2_Queue

Assignment 04 - Prim 1_2_Queue - (Hint Modify Prim’s...

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

View Full Document Right Arrow Icon
The Hong Kong University of Science & Technology COMP 271: Design and Analysis of Algorithms Fall 2007 Assignment 4 Assigned: 4/10/07 Due Date: 4pm, 11/10/07 Question 1 : Let G = ( V, E ) be a connected undirected graph in which all edges have weight 1 or 2. Give an O ( | V | + | E | ) algorithm to compute a minimum spanning tree of G. Justify the running time of your algorithm.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (Hint: Modify Prim’s algorithm). Notes : You can discuss homework question with your classmates, but you must write up your answers independently. Acknowledge the people with whom you have discussed the assignment. 1...
View Full Document

{[ snackBarMessage ]}