Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.
10-05-2022 02:59 AM
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
All the sessions of the conference are now available online
