This is an implementation of the Greedy algorithm for coloring graphs but with a little twist. Given a graph A and an integer p, this algorithm colors the graph with the Greedy approach until it has colored p nodes. Then, it chooses the next node to color in a dynamic way considering the already colored nodes.
-
Notifications
You must be signed in to change notification settings - Fork 0
PedroSalas216/Lab3-Discreta2
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