allShortestPaths implementation?

Drivers & Stacks
1

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