225_40_Kruskal - Startatvertex0....

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
1 Start at vertex 0. Find the parent and DFI arrays resulting from a DFS.  Show the stack at each step of the computation. When you traverse the neighbours of a vertex, traverse  them in numerical order.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Find a simple f(n) so that n – 200 is in  Θ (f(n)). Prove that n – 200 is in  Θ (f(n)). What is wrong with this “proof”: n – 200 ≥  -200 * n 2   for n ≥ 1 and therefore n – 200 is in  (n 2 ). 2
Background image of page 2
Annoucements: Assignment #4 has been posted. It only has a written component and is due Friday  Nov. 18 at the beginning of class. Please check your final exam schedule for Wed. Dec. 7,  and Thurs. Dec. 8 (for scheduling a final exam  tutorial).
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 How many connected components does a graph have  and which vertices are in each component? Algorithms: BFS, DFS or UNION/FIND
Background image of page 4
5 Minimum weight spanning tree: Put a non-negative weight on each edge.
Background image of page 5

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

View Full DocumentRight Arrow Icon
Image of page 6
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 / 20

225_40_Kruskal - Startatvertex0....

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online