RxJava Travelling Salesman Problem

Goal

Demonstrate how to solve the TSP both with the Nearest Neughbour algorithm (NN) and Simulated Annealing heuristic (SA).

Startup

To make sure you have all the required tools run the following commands

Clone this repo:

git clone git@github.com:sircelsius/tsp-rx.git

Run the app skeleton

./gradlew run

Once these steps are green, proceed to branch 1.0.0 and follow the steps there.