exercise 6.1 find the number of different shortest paths from point a to point b in a city with...

Download Exercise 6.1 Find the number of different shortest paths from point A to point B in a city with perfectly horizontal streets and vertical avenues as shown

If you can't read please download the document

Upload: britney-owen

Post on 18-Jan-2018

217 views

Category:

Documents


0 download

DESCRIPTION

Network We have a digraph G with edge capacities u: E(G)→ R + and two specified vertices s (the source) and t (the sink). The quadruple (G, u, s, t) is sometimes called a network. Our main motivation is to transport as many units as possible simultaneously from s to t. A solution to this problem will be called a maximum flow.