1 / 15

The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem

The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem. Ford-Fulkerson Max Flow. 4. 2. 5. 1. 3. 1. 1. 2. 2. s. 4. t. 3. 2. 1. 3. This is the original network, and the original residual network. Ford-Fulkerson Max Flow. 4. 2. 5. 1. 3. 1. 1. 2. 2. s.

makya
Download Presentation

The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. The Ford-Fulkerson Augmenting Path Algorithm for the Maximum Flow Problem

  2. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 2 s 4 t 3 2 1 3 This is the original network, and the original residual network.

  3. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 2 s 4 t 3 2 1 3 Find any s-t path in G(x)

  4. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 1 2 s 4 t 1 2 3 2 1 1 1 3 Determine the capacity D of the path. Send D units of flow in the path.Update residual capacities.

  5. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 1 2 s 4 t 1 2 3 2 1 1 1 3 Find any s-t path

  6. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 1 1 1 s 4 t 1 1 2 3 2 2 1 1 1 1 1 3 Determine the capacity D of the path. Send D units of flow in the path.Update residual capacities.

  7. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 1 2 1 1 s 4 t 1 1 2 3 2 2 1 1 1 1 1 3 Find any s-t path

  8. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 1 1 1 s 4 t 2 1 2 1 2 3 1 1 1 1 1 3 Determine the capacity D of the path. Send D units of flow in the path.Update residual capacities.

  9. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 1 2 1 1 s 4 t 1 2 2 1 2 3 1 1 1 1 1 3 Find any s-t path

  10. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 1 2 1 1 s 4 t 1 2 2 1 1 2 1 1 1 2 1 2 1 3 Determine the capacity D of the path. Send D units of flow in the path.Update residual capacities.

  11. Ford-Fulkerson Max Flow 4 2 5 1 3 1 1 2 1 1 1 s 4 t 2 1 1 2 1 2 1 1 2 1 2 1 3 Find any s-t path

  12. Ford-Fulkerson Max Flow 4 3 2 5 1 1 3 2 1 1 1 1 s 4 t 2 1 2 1 1 2 1 1 2 1 2 1 3 Determine the capacity D of the path. Send D units of flow in the path.Update residual capacities.

  13. Ford-Fulkerson Max Flow 3 4 2 5 1 1 3 2 1 1 1 1 s 4 t 1 2 1 2 1 2 1 1 2 1 2 1 3 There is no s-t path in the residual network. This flow is optimal

  14. Ford-Fulkerson Max Flow 4 3 2 2 5 5 1 1 3 2 1 1 1 1 s s 4 4 t 1 2 2 1 1 2 1 1 2 1 2 1 3 3 These are the nodes that are reachable from node s.

  15. 1 2 5 1 1 2 2 s 4 t 2 2 3 Ford-Fulkerson Max Flow Here is the optimal flow

More Related