Example: dental hygienist
Lecture 20 Max-Flow Problem and Augmenting Path Algorithm

Lecture 20 Max-Flow Problem and Augmenting Path Algorithm

Back to document page

of the path In other words, the capacity of a path is the maximum possible amount that we can send along the path The capacity C(p) of the path p is given by C(p) = min (i,j)∈p u ij where u ij is the capacity of the link (i,j) If the path p under consideration …

  Path, A path

Download Lecture 20 Max-Flow Problem and Augmenting Path Algorithm


Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Advertisement

Related search queries