Travelling Salesman Problem (TSP) with Recursion | Stack Memory Visualization
🎁 FREE Algorithms Interview Questions Course - https://bit.ly/3s37wON
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
Travelling Salesman Problem is an NP-hard combinatorial optimization related problem. We want to find a closed cycle in a G(V,E) graph with the shortest path.
We can solve this problem with recursion (basically backtracking which is the same as depth-first search). Of course the problem is that there are O(V!) possible solutions we have to consider - where V is the number nodes in the graph.
We can come to the conclusion that meta-heuristic approaches (such as genetic algorithms or simulated annealing) are better for this problem. We can find quite a good solution quite fast with genetic algorithms.
🫂 Facebook: / globalsoftwarealgorithms
🫂 Instagram: / global.software.algorithms