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 backgro...
Hi all,
My question is very simple : Is there anyway to obtain the node depths from the results produced by BFS/DFS algorithms.
I appears that these algos only produce the path they used to visit the graph.
Thank you in advanvce
Best,
Augustin
