Graph Cost

overview

Summary

Graph cost captures how we measure and optimize over weighted graphs, usually by minimizing or maximizing sums of edge weights. Core problems include building minimum spanning trees, finding shortest paths, and pushing flow through networks. The right algorithm depends on weight properties, graph density, and whether you need single-source, all-pairs, or global connectivity. Greedy strategies often win, but only when the problem has the right structure.