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

http://mathworld.wolfram.com/travelingsalesmanproblem.html


Comments

Popular posts from this blog

ios - RestKit 0.20 — CoreData: error: Failed to call designated initializer on NSManagedObject class (again) -

laravel - PDOException in Connector.php line 55: SQLSTATE[HY000] [1045] Access denied for user 'root'@'localhost' (using password: YES) -

java - Digest auth with Spring Security using javaconfig -