Project 2 for AATN, primarily deals with network cut problem. Nagamochi-Ibaraki algorithm implementation for finding minimum cut in an undirected graph.