The above python code will take a network data as input and bisect the graph in such a way that the cut size is minimum.
It uses Kenighan-Lin algorithm for partitioning the graph.
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.
The above python code will take a network data as input and bisect the graph in such a way that the cut size is minimum.
It uses Kenighan-Lin algorithm for partitioning the graph.
The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.