cancel
Showing results for 
Search instead for 
Did you mean: 

allShortestPaths implementation ?

Augustin
Node

Hi,

I am currently using the following query to count the number of shortest paths between 2 nodes : 

MATCH s = allShortestPaths((a:Node{name:"A"})-[:REL*]-(b:Node{name:"E"}))
RETURN count(s)

But I have no idea what algorithm is running in the background, BFS , DFS, dijkstra ?

Best,

Augustin 

 

 

0 REPLIES 0
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.