Graph is a complete graph -it called K6- IT HAS 6 VETICES. also, every vertex is connected to every other vertex.
a) how many possible Hamilton circuits ( say starting from A) including reversals, does the graph have?
b) if we were to use the Brute Force algorithm to solve the Traveling Salesman problem on this graph, how many circuits ( say starting from A) would list, including reversals?
c) how many circuits would we list if we used the Repetitive Nearest Algorithm to find an approximate solution to the TSP?
1 answer