ID NAME QUALITY USERS ACC % DIFFICULTY C I
33022 Ada and Hose   10
1693 Coconuts   12 645
21
28
34409 Disconnected country   1 23
34
34
9577 Dynamic Tree Connectivity   10 330
32
26
4485 MobiZone vs VinaGone   6 284
20
31

#min-cut

A cut is a partition of vertices of a graph into two subsets disjoint subsets. Minimum cut is a cut with a smallest possible cut-set.

https://en.wikipedia.org/wiki/Minimum_cut http://www.cs.princeton.edu/courses/archive/spr04/cos226/lectures/maxflow.4up.pdf