Water transport on finite graphs
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We fix one node v and consider the optimization problem relating to the maximum value to which the level in v can be raised without pumps, i.e. by opening/closing pi
