TechNetiZs

Flow Network is a directed graph in which each edge has a capacity and each edge receives a flow.  In this blog, we will discuss the following things: Introduction of:  network, max-flow problem capacity, flow Ford-Fulkerson method pseudo code, residual networks, augmenting paths cuts of networks Introduction -  Network We can understand Network by looking into some examples: liquids flowing in pipes, parts through assembly lines in a factory, the current through electrical network. Flow Network: Directed graph, G=(V, E)                              where V is set of vertices,                                            E is set of Edges. Max-Flow problem Max-flow problem is about finding the feasible flow through a flow network and with maximum possible flow ra...