I am wondering if any of the shortest path algorithm can works in this way -
Say I have five destinations A,B,C,D and E and all are connected by roads. I want to know the shortest distance it takes to leave A, travel each of the nodes once and return back to A.
