So let's say i have a graph like this and salesman starts his journey at A How do i solve the TSP problem for this graph with pen and paper on exam?
Traveling Salesman problem solution for small graph?
algorithms;graphs;optimization;graph traversal