# 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.

[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.

#### Solution Summary

This posting contains solution to following problems on Shortest Path and Maximal Flow technique.