main.cpp

/*************************************************************************
Title: main.cpp
Description: main method for our Christofides implementation
Authors: Sean Hinds, Ryan Hong, Jeff Herlitz
Date: 08/16/17

Changes:
- cities coordinate changed from int to double
- removed useless path_vals
*************************************************************************/

#include <iostream>
#include "tsp.h"
//#include "twoOpt.h"

int main(int argc, char** argv) {
	if(argc < 2){
		exit(-1);
	}

	// Read file names from input
	string input, output;
	input = output = argv[1];
	output.append(".tour");

	// Create new tsp object
	TSP tsp(input, output);
	cout << "tsp created" << endl;
	int tsp_size = tsp.get_size();

	// Fill N x N matrix with distances between nodes
	cout << "Fillmatrix started" << endl;
	tsp.fillMatrix();
	cout << "Filled Matrix" << endl;

	// Find a MST T in graph G
	tsp.findMST();
	cout << "MST created" << endl;

	// Find a minimum weighted matching M for odd vertices in T
	tsp.perfectMatching();
	cout << "Matching completed" << endl;

	// Loop through each index and find shortest path
	TSP::distance_t best = TSP::DINF;
	int bestIndex = -1;
	for (long t = 0; t < tsp_size; t++) {
		TSP::distance_t result = tsp.findBestPath(t);
		if (result < best) {
			bestIndex = t;
			best = result;
		}
	}
	cout << "BestPath completed " << bestIndex << endl;

	//Create path for best tour
	tsp.euler_tour(bestIndex,tsp.circuit);
	tsp.make_hamiltonian(tsp.circuit,tsp.pathLength);

	/*
	tsp.euler_tour(0, tsp.circuit);
	cout << "euler completed" << endl;
	tsp.make_hamiltonian(tsp.circuit, tsp.pathLength);
	cout << "ham completed" << endl;
	*/

	// Store best path
	//tsp.create_tour(bestIndex);

	cout << "Final length: " << tsp.pathLength << endl;

	// Print to file
	tsp.printPath();
	tsp.printResult();
}