cancel
Showing results for 
Search instead for 
Did you mean: 

Path Planning Algorithm

parthiv3215
Node Clone

Hello,

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. 

Any help would be really appreciated. 

1 REPLY 1

rohit_kumar01
Node Clone

use dijkstra algo

Nodes 2022
Nodes
NODES 2022, Neo4j Online Education Summit

On November 16 and 17 for 24 hours across all timezones, you’ll learn about best practices for beginners and experts alike.