Neo4J:找到一个任意深度的子图，该子图具有通过给定关系集连接的节点? [英] Neo4J: find a sub-graph of arbitrary depth with nodes connected by a given set of relations?

问题描述

如何构建Neo4J查询:

How to build a Neo4J query that:

1)是否将返回任意深度的子图中具有通过给定关系集连接的节点的所有节点?

1) Will return all nodes in a sub-graph of arbitrary depth with nodes connected by a given set of relations?

例如类似Cypher的语法:

For example in Cypher-like syntax:

MATCH (*)-[r1:FRIEND_OF AND r2:COLLEAGUE_WITH]->(*) RETURN * 

推荐答案

此查询将仅返回节点，如您在问题中所述:

This query will return just the nodes, as you stated in your question:

MATCH (n)-[:FRIEND_OF|COLLEAGUE_WITH*]->(m)
RETURN n, m;

如果您还想要关系:

MATCH (n)-[r:FRIEND_OF|COLLEAGUE_WITH*]->(m)
RETURN n, r, m;

这篇关于Neo4J:找到一个任意深度的子图，该子图具有通过给定关系集连接的节点?的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！