About this document
Understanding Capacitated Networks by varunsingh214761 is a document available to read on EtoBox.
A capacitated network is a digraph with a capacity function defined on its arcs. It contains a source vertex with in-degree zero and a sink vertex with out-degree zero. Each arc has a nonnegative capacity. A flow assigns each arc an integer value between 0 and its capacity, satisfying the conservation condition that inflow equals outflow at non-source/sink vertices. Finding the maximum possible flow value from source to sink is the maximum flow problem.
- Author
- varunsingh214761
- Language
- EN