Résumé de section

  • In this chapter, we study flow problems in transport networks.
    First, we introduce the basic definitions related to networks, capacities, and flows.

    Then, we focus on the problem of finding a maximum flow in a transport network. We define the concept of maximum flow and present the Ford–Fulkerson theorem, which gives the theoretical foundation of the method. After that, we explain the Ford–Fulkerson algorithm used to compute the maximum flow.

    Finally, we study the problem of finding a compatible flow, that is, a flow that satisfies given constraints in the network.