[haiken@haiken-manjaro 02-project3]$ time ./main
Sufficient distances.txt file loaded. Would you like to use the existing one?
(1 => use existing;	 0=> generate new): 0
Recreating and flooding distances.txt...
Enter how many (integer) cities to simulate: 12
Enter how many (integer) individual tours are in a given generation: 2
Enter how many (integer) generations to simulate: 2
Enter what percentage (float) of each generation should be comprised of mutations: 2
Best possible tour time: 415.037
Best possible tour: 7, 10, 9, 5, 2, 8, 3, 12, 1, 11, 6, 4

real	0m31.874s
user	0m29.964s
sys	0m0.013s
[haiken@haiken-manjaro 02-project3]$ make clean main
rm -f brute.o main test genrand *.out *.core vgcore*.* *.vcore core
g++  -std=c++11 -Wall -g   -c -o brute.o brute.cpp
g++ -std=c++11 -Wall -g  -o main brute.o main.o
g++ -std=c++11 -Wall -g  -o genrand genrand.cpp
[haiken@haiken-manjaro 02-project3]$ time ./main
Sufficient distances.txt file loaded. Would you like to use the existing one?
(1 => use existing;	 0=> generate new): 1
Enter how many (integer) cities to simulate: 12
Enter how many (integer) individual tours are in a given generation: 2
Enter how many (integer) generations to simulate: 2
Enter what percentage (float) of each generation should be comprised of mutations: 2
Best possible tour time: 415.038
Best possible tour: 1, 11, 6, 4, 7, 10, 9, 5, 2, 8, 3, 12

real	0m4.472s
user	0m2.503s
sys	0m0.000s
[haiken@haiken-manjaro 02-project3]$