Coding Challenge #35.3: Traveling Salesperson with Lexicographic Order

TL;DR

This video demonstrates combining the lexical order algorithm with the traveling salesperson problem to check every possibility in order.

Transcript

hello and welcome to part three of an of a coding Challenge and I don't know they're individual coding challenges or part of a sequence of coding challenges who knows but in this particular one what I'm going to do is I'm going to look at this traveling salesperson problem again a list a random list of eight cities and right now the program is just... Read More

Key Insights

• 🪈 Combining the lexical order algorithm with the traveling salesperson problem provides a method to check every possibility in order.
• 🪈 The order array is used to track the order of cities in the traveling salesperson problem.
• 🪈 The program displays the current order being checked and the best order found so far, allowing for optimization analysis.

Questions & Answers

Q: What are the two algorithms being combined in this video?

The lexical order algorithm and the traveling salesperson problem algorithm.

Q: How is the order of cities being tracked in the program?

The order of cities is tracked using the order array, which is modified to store the indexes of cities.

Q: How does the program check every possibility in order?

The program utilizes the lexical order algorithm to generate every possible order of cities, which is then tested by the traveling salesperson problem algorithm.

Q: What is displayed in the program?

The program displays the current order being checked and the best order found so far.

Summary & Key Takeaways

• The video focuses on combining the lexical order algorithm with the traveling salesperson problem.

• The code is modified to incorporate the lexical order algorithm and the order array is used to track the order of cities.

• The program checks every possibility in order and displays the best order found so far.