9 5 Counting Minimum Cuts 7 min

[@trung.nguyen.t]

Thanks for the lesson! This is really great fun!

[@MrGregnsk54]

just for fun! I like how passionate you are about algorithms)

[@prithirajmallik1419]

0:40 i think a tree with m edges has m min cuts not vertices.

[@starlord0732]

Not actually. When making a min-cut, we are dividing all available nodes into two groups, not the edges. So for a given graph, the number of min-cuts depends on the nodes and not edges. That's the reason it is n-1.