Nagamochi-Ibaraki we implement the Nagamochi-Ibaraki Algorithm for Finding a Minimum Cut in An Undirected Graph.