MonaLisaJS is a project in preperation for JSConf EU.
Want to know where I am working on? Follow the Trello board.
This project uses submodules. Run the following commands to get a working project.
$ git submodule init $ git submodule update
The above procedure should be repeated for the directory
Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is a famous problem in the theory of graphs.
Given a list of cities and their pairwise distances, the task is to find the shortest possible route that visits each city exactly once and returns to the origin city.