intro
Use Graph (data structure)s
Max-cut
Algorithm to identify planar graphs
Topological sorting
Breadth-first search
Depth-first search
Min-cut