2c03-review - 00087

2c03-review - 00087 - Since the solution given for question...

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

View Full Document Right Arrow Icon
v 1 v 3 v 5 s t v 2 v 4 v 6 9 4 15 10 6 4 12 5 17 4 9 8 3 2 6 4 8 15 v 1 v 3 v 5 s t v 2 v 4 v 6 9 4 12 3 10 6 4 9 3 5 17 4 9 8 3 2 6 4 8 12 3 v 1 v 3 v 5 s t v 2 v 4 v 6 9 4 4 11 10 6 4 1 11 5 17 4 1 8 8 3 2 6 4 8 4 11 No more augmenting paths exist, so we are done. Question 8 The Edmonds-Karp algorithm is a special case of the Ford-Fulkerson algorithm, in which we must always choose an augmenting path consisting of the least number of possible edges.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Since the solution given for question 7 follows such a pattern, it is also a solution to this question. 3...
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