A salesperson is traveling through 6 cities. There is a weighted graph of 23, 25, 27, 31, 36, and 45. I know there are 60 possible routes. n-1/2 or 5!/2=60. How do I find the shortest or lowest number route?
A salesperson is traveling through 6 cities. There is a weighted graph of 23, 25, 27, 31, 36, and 45. I know there are 60 possible routes. n-1/2 or 5!/2=60. How do I find the shortest or lowest number route?
Is this complete? Should the weights not be associated with edges? What are the edges or whatever.