225_31_Dij_MST

# 225_31_Dij_MST - 1.Drawtheunionfinddata...

This preview shows pages 1–5. Sign up to view the full content.

1 1. Draw the union find data  structure after the weighted union  W_UNION(0,8). Use a weighted union  that calls a collapsing  find. 2. What is in the parent  array after the union?

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Assignment #5: Available from class web page. Due  Friday Dec. 2 at the beginning of class. Final exam tutorial: Wednesday Dec. 7 at 12:00pm,  Elliott 061. 8 old final exams are available from our class web page. Try analysing the variants of Kruskal’s algorithm as per  the 2009 final exam, question #4.
3 Computer Science Lab Evaluations  Please login to connex to evaluate your tutorial  instructor this week. Due to database corruption problems, anyone who  completed a lab evaluation prior to November 21, 2011  will have to re-do that lab evaluation. Each lab evaluation response is anonymous. All  information and comments will be given to selected  Computer Science personnel only after the final grades  have been sent to Records Services.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Minimum weight spanning tree: Put a non-negative weight on each edge. Weight of a tree: sum of weights of its edges. Problem: find a spanning tree of graph G with minimum  weight. Kruskal’s algorithm: sort edges by weight.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/15/2012 for the course CSC 225 taught by Professor Valerieking during the Spring '10 term at University of Victoria.

### Page1 / 27

225_31_Dij_MST - 1.Drawtheunionfinddata...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online