计算最短路径neo4j之后的节点数

Question

MATCH (FooB:Actor { name: 'Foob' }),(AnnaH:Actor { name: 'Anna Hathaway' }), p = shortestPath((Foob)-[act:ACTED_IN*]-(AnnaH))
RETURN p

因此，这返回了一个图p，它是从演员Foob到Anna Hathaway的最短路径。我现在如何计数CCD_ 2中标签为"0"的所有节点；巧克力"；？

Answer 1

这应该是

RETURN SIZE([n IN nodes(p) WHERE n:chocolate]) AS count

Answer 2

将节点功能与UNWIND:结合使用

MATCH (FooB:Actor { name: 'Foob' }),(AnnaH:Actor { name: 'Anna Hathaway' }), p = shortestPath((Foob)-[act:ACTED_IN*]-(AnnaH))
UNWIND nodes(p) AS n
WITH n AS n
WHERE n.chocolate
RETURN COUNT(*)