Advanced Data Structures

Fall 2003

[ CIS 410/510 | CIS | UO | News ]

Assignment 8

Due Wednesday Dec. 3

  1. Solve the max-flow problem for the network in Figure 8.4 using the Sleator-Tarjan algorithm discussed in class. Show the results of as many steps as it is reasonable.