java - Can Dijkstra's algorithm be used to find the quickest way to return to the route node? -
i have directed graph nodes abcdefgh.
i have dijkstra working can find quickest route a-f (for example).
if wanted find quickest path a-a, dijkstra's appropriate algorithm use?
usually if want same node have started concept of ts(travelling salesman) come in play given traversing through node(abcdefgha). can check ts below
Comments
Post a Comment