Graph Theory.
algorithms also rely on minimum spanning trees Network flow: max flow — Q: With an infinite input source how much “flow” can we push through the network? → Suppose the edges are roads with cars, pipes with water, or hallways with packed with people. Flow represents the volume of water allowed to