Shortest Path and Maximal Flow Problem
Please see the attached file for the fully formatted problems.
1. Shortest Path and Maximal Flow Problem (30%): You are given the following directed network.
a. (Shortest Path Problem 15%) Let the numbers on the arcs represent distances and find the shortest path from node 1 to node 9.
b. (Maximal Flow Problem 15%) Let the numbers represent flow capacity and find the maximum flow from node 1 to node 9.
This question has the following supporting file(s):
This posting contains solution to following problems on Shortest Path and Maximal Flow technique.
This answer includes:
- Plain text
- Cited sources when necessary
- Attached file(s)
Active since 2006