To use the application, you should add to the "test" file the number of vertices that the graph to be tested has and its adjacency matrix. When running the system, you will have the option 1 to execute the heuristic and 2 to execute the brute-force algorithm. The result will be generated in the terminal.
-
Notifications
You must be signed in to change notification settings - Fork 0
In this project, we aim to solve an interference problem among Wi-Fi routers using graph coloring. We have developed a brute-force algorithm and also applied a heuristic to compare the efficiency and results of the two alternative.
bernardoleris/graph-algorithms
About
In this project, we aim to solve an interference problem among Wi-Fi routers using graph coloring. We have developed a brute-force algorithm and also applied a heuristic to compare the efficiency and results of the two alternative.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published