You have learned minimum cuts: partitions that disconnect graphs with minimum cost. You saw the max-flow min-cut theorem and how to extract min cuts from max flow. You also learned about global minimum cuts, edge/vertex connectivity, and applications in network reliability and image segmentation.
You solved problems finding minimum roads to block, extracting edge-disjoint paths, and computing global min cuts with Stoer-Wagner. These techniques are the foundation for network analysis.