Implementação do problema do Caixeiro Viajante (TSP) euclidiano, utilizando um algoritmo aproximativo e um algoritmo exato. Desenvolvido junto com @Yasmin-Camargo para a disciplina de Algoritmos e Estruturas de Dados III
The Minimum Graph Coloring Problem using exact algorithms along with heuristics and metaheuristics.
Add a description, image, and links to the exact-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the exact-algorithm topic, visit your repo's landing page and select "manage topics."