Due: Friday, November 19, 2021
Read Chapter 26 in the text on Maximum Flow.
I provide a specification and a skeletal body for package CIS5050.Edmonds_Karp in the class sample programs Git repository. Implement the unimplemented subprograms in the body.
The pseudocode in the text is quite high level. You may find the pseudocode on Wikipedia of interest. However, be aware that the pseudocode on Wikipedia appears to assume the graph is represented using some sort of matrix representation (although it's actually not too clear). The code provided for this assignment uses an adjacency lists representation. You will need to adapt the code accordingly.
Create a zip archive of the files cis5050-edmonds_karp.ads and cis5050-edmonds_karp.adb. Submit your archive to Canvas.
Last Revised: 2024-11-30
© Copyright 2024 by Peter Chapin <peter.chapin@vermontstate.edu>