Implementations of Travelling Salesman using several well-known heuristics:
- 2-opt
- minimum Spanning Tree
- Random Tour
- Farthest Neighbor
- Nearest Neighbor
Next to that, it contains code that implements various shortest path algorithms under various edge constraints.