Solving the Traveling Salesman Problem with Dynamic Programming

Solving the traveling salesman problem using dynamic programming

Related Videos:
TSP intro: https://www.youtube.com/watch?v=cY4HiiFHO1o
TSP code video: https://www.youtube.com/watch?v=udEe7Cv3DqU

Source code:
https://github.com/williamfiset/algorithms#graph-theory

Powerset backtracking video:
https://www.youtube.com/watch?v=RnlHPR0lyOE

=====================================

Practicing for interviews? I have used, and recommend `Cracking the Coding Interview` which got me a job at Google. Link on Amazon: https://amzn.to/3cvMof5

A lot of the content on this channel is inspired by the book `Competitive Programming` by Steven Halim which I frequently use as a resource and reference. Link on Amazon: https://amzn.to/3wC2nix

Support me by purchasing the full graph theory course on Udemy which includes additional problems, exercises and quizzes not available on YouTube:
https://www.udemy.com/course/graph-theory-algorithms