Maximum Flow
Input description: a graph (network) G where each edge (v,w) has associated capacity c(v,w), and a specified source node s and sink node t
Problem description: What is the maximum flow you can route from s to t while respecting the capacity constraint of each edge?