Explore BrainMass

# Shortest Path and Maximal Flow Problem

Not what you're looking for? Search our solutions OR ask your own Custom question.

This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

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.

https://brainmass.com/math/optimization/shortest-path-maximal-flow-problem-212786

#### Solution Preview

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.

This is a shortest route problem. Following are the steps to follow.
1. Find the nearest node to the origin. Put the distance in a box by the node.
Nearest node to node 1 is node 2 at a distance of 3.

2. Find the next nearest node to the origin, and put the distance in a box by the node. In some cases, several paths will have to be checked to find the nearest ...

#### Solution Summary

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

\$2.49