Groups
Category
Level
Many classic problems can be modeled as a maximum flow problem by building the right network and capacities.
A biconnected component (block) is a maximal subgraph where removing any single vertex keeps it connected.