Rusty TSP

This is an implementation of 2-opt for solving the TSP. It is a very predictable algorithm in terms of behaviour, but still a computationally demanding algorithm for most devices. A perfect use case for WebAssembly, it is written in Rust, run in a Web Worker and compiled with the necessary glue code to run it along with this demo page. The repo is hosted on my Github. Try it below!