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.

Part 1:
Part 2:
Part 3:
Part 4:
Part 5:

Support this channel on Patreon:

Send me your questions and coding challenges!:

Contact:

Links discussed in this video:
MDN Array Reference:
Traveling Salesman on Wikipedia:
Permutation Algorithm Using Lexicographic Ordering:

Source Code for the Video Lessons:

p5.js:
Processing:

For More Coding Challenges:

Help us caption & translate this video!