## Traveling Salesperson with Lexicographic Order

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.

### Community Contributions

- 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) - TSP with 2-opt
*by Elijah Beregovsky*(Source Code) - TSP with simulated annealing
*by Elijah Beregovsky*(Source Code) - TSP with Genetic algorithm
*by Elijah Beregovsky*(Source Code) - Traveling Salesperson Problem - The 3 Approaches - Python (Processing 3)
*by Varun Rustom Irani*(Source Code) - Genetic Algorithm for Traveling Salesman Problem written in Rust
*by Mithi Sevilla*(Source Code) - Traveling Salesman With Lexico Algorithm - With performance data and node number selection
*by Mathieu 'Millefeuille' Labourier*(Source Code) - Traveling Salesman With Lexico Algorithm - With performance data and node number selection
*by Lucas Duez Verzaro dos Santos* - Python,matplotlib implementation and visualization of TSP using GA
*by Atharva Kale*

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