spanner_tree_generator

main_paralelo -> Receive a graph (file .txt), and executes parallel brute-force algorithm.
main_run_all - > Receive a graph (file .txt), and executes brute-force sequential, brute-force parallel, heuristic 1 and 2 strategies.
main_run_all2 -> Receive a graph (file .txt), and executes brute-force sequential, heuristics 1 and 2.

Setup parameters in generator.py file. Path to store the graphs must be created in advance.

exec_compare.sh -> Executes the graphs with sequential algorithm comparing it to heuristics H1, H2 and parallel algorithm. (Built by running "make build_compare")
exec_compare_heu.sh -> Executes the graphs with heuristics strategies comparing them against two lower bounds (Built by running "make build_compare_heu")

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
code		code
grafos		grafos
grafos_barabasi		grafos_barabasi
grafos_bi_partido		grafos_bi_partido
grafos_erdos		grafos_erdos
grafos_watts		grafos_watts
result		result
.gitignore		.gitignore
LICENSE		LICENSE
Makefile		Makefile
README.md		README.md
exec_compare.sh		exec_compare.sh
exec_compare_heu.sh		exec_compare_heu.sh
generator.py		generator.py
main.cpp		main.cpp
main_compare.cpp		main_compare.cpp
main_compare_heu.cpp		main_compare_heu.cpp
main_generate_graph.cpp		main_generate_graph.cpp
main_paralelo.cpp		main_paralelo.cpp
main_run_all.cpp		main_run_all.cpp
main_run_all2.cpp		main_run_all2.cpp
main_teste.cpp		main_teste.cpp
run_all.sh		run_all.sh
run_all2		run_all2
run_all_heur.sh		run_all_heur.sh
run_compare.sh		run_compare.sh

Provide feedback