Solving the Travelling Salesman Problem using A* with Minimum Spanning Tree Heuristic.

To run

Clone the repo, cd into it, then

bazel run //solver:solver <path to graph file>

Sample Graphs are in the sample_graphs/

Progress bar adapted from aminnj/cpptqdm.

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
graph		graph
graph_generator		graph_generator
input		input
sample_graphs		sample_graphs
screenshots		screenshots
solver		solver
state		state
tqdm		tqdm
.bazelrc		.bazelrc
README.md		README.md
WORKSPACE		WORKSPACE