Find shortest path between 2 nodes using a node property filter

Question

I have a graph database that consists of nodes (bus stations) with a property called “is_in_operation” which is set to “true” if the bus station is operational; otherwise it is

Answer 1

The problem is that shortestPath can't take into account the where clause, so you're matching the shortest path, and then filtering it out with your where.

How about this one--it might not be as efficient as shortestPath, but it should return a result, if one exists:

START d=node(1), e=node(5) 
MATCH p = d-[*..15]->e
where all (x in nodes(p) where x.is_in_operation='true')
RETURN p
order by len(p)
limit 1;