coding challenge #35.3

In Part 3 of the Traveling Salesperson coding challenge, I take the lexicographic ordering algorithm apply it to a brute-force solution of the Traveling Salesperson problem. Every single route permutation is checked one by one.

- Typescript Implementation of TSP GA
*by Gareth Williams*(Source Code) - Object Oriented TSA
*by James Williams*(Source Code) - Observable TSA
*by Allan Seidel*(Source Code) - TSM Algo Compare
*by Storealutes*(Source Code)

You can also add your own version! (See how)