(PT-BR 🇧🇷) Projeto final da disciplina Algoritmos e Estrutura de Dados do Programa de Pós-Graduação em Computação Aplicada (PPCA) da Universidade de Brasília (UnB).
(EN-US 🇺🇸) Final project of Data Structure and Algorithms Class on the Applied Computation Post-Graduation Program of Universidade de Brasília (UnB).
All graphs are in DIMACS (ASCII, undirected) format. For example, a file with the following contents would represent a graph with four vertices with weights 10, 11, 12, 13 and a single edge from the first vertex to the second vertex.
p edge 4 1
n 1 10
n 2 11
n 3 12
n 4 13
e 1 2
- Install dependencies with
pip install -e .- Execute ppca_aed_projeto_final, a simple usage can be achieved with
python ppca_aed_projeto_final aco --input-dir dimacs_benchmark_setWhere the first argument aco represents the method to find a maximum clique. Avalaible options are:
| Argument | Method |
|---|---|
| aco | Ant Colony Optimization |
| bnb | Branch and Bound |
| greedy | Greedy Search |
Second argument input-dir where to find the tests graphs.