2c03-review - 00082

2c03-review - 00082 - (a) Kruskal’s algorithm: a b g ± c...

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

View Full Document Right Arrow Icon
Question 8 Assuming alphabetical ordering, the solution is: A 1 / 12 O 28 / 29 H 14 / 17 I 15 / 16 B 2 / 3 C 4 / 5 G 13 / 18 J 19 / 30 K 20 / 21 D 7 / 8 E 9 / 10 F 6 / 11 N 25 / 26 L 22 / 27 M 23 / 24 Ordering by decreasing fnishing times gives the topological sorting: J O L N M K G H I A F E D C B Question 9 Edges are numbered in the order that they are added.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (a) Kruskal’s algorithm: a b g ± c i e d h 7 1 4 5 6 8 2 3 (b) Prim’s algorithm: a b g ± c i e d h 1 2 5 6 7 8 3 4 2...
View Full Document

This note was uploaded on 12/10/2009 for the course CAS 2c03 taught by Professor Janicki during the Spring '03 term at McMaster University.

Ask a homework question - tutors are online