Facing Problem in Finding K-shortest path in neo4j among 2M+ nodes,2M+ relationships, I have indexed data on node id and name.
Query :
MATCH p = (s:Test)-[:to*1..5]->(e:Test) WHERE s.name = 'ABC' RETURN *, relationships(p),sum(reduce(sum=0,x in rel...