A quick implementation in Python using an object model instead of an adjacency matrix of the Kernighan-Lin algorithm for graph partition.
forked from raphaelgodro/Kernighan-Lin
-
Notifications
You must be signed in to change notification settings - Fork 0
CodeBear801/Kernighan-Lin
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Quick implementation of the Kernighan-Lin graph partition algorithm in Python
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 100.0%