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.
-
Notifications
You must be signed in to change notification settings - Fork 2
ambirpatel/Kernighan-Lin-Scratch-code-for-graph-partitioning
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
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.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published