> > In a previous math class, we > > studied an algorithm for solving the traveling salesman > > problem (I think > > the name wa s Dijastra's or something like that - I need to > check). We > > never did the code, but we did study the idea for how it > > could be done. > > Is it OK to use this for my problem set?
Dijkstra's algorithm is a powerful and important algorithm. It is part of routing code on many routers throughout the world. However, it doesn't solve the traveling salesman problem. If you found a polynomial time algorithm (as Dijkstra's is) to solve the traveling salesman, you would be famous, and we would be honored to give you an A in the course. - jeff parker
