This Code will attempt to grab any n number of vertex's and store them in the smallest amount of containers possible. It will find the lowest minimum of the entire group, then find the biggest maximum for that group, group them and remove it from the set. It will then repeat itself until it produces the smallest amount of containers needed.
-
Notifications
You must be signed in to change notification settings - Fork 0
Sailanarmo/Group-Algorithm
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
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published