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.
It seems like there haven't been made any variations based on this coding challenge by the community yet. Be the first and add your own! If you don't know how, take a look at this guide.