Home/ Questions/Q 8147447
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-06T14:21:15+00:00

Is there a query for a Neo4J graph that could traverse said graph and

  • 0

Is there a query for a Neo4J graph that could traverse said graph and find nodes based on mutual relationships? For example, if Node A is related to Node B (bidirectionally), B is related to C, C is related to D, D is related to A, A is related to C, and B is related to D, such that there is a subgraph in which every node is connected to every other node, is there an efficient way to return that subgraph or group of Nodes?

I realize my explanation is poor, so I provide an example graph in the console: http://console.neo4j.org/r/qb2xmp

Here, I have created a graph, and I would like to return groups that are mutually related of 3 or more – so, in this case, I would ideally like to be returning the group of Scott, Josh, Frank, and Ben, as well as the group of Frank, Ben, and Eric. If possible, I would like to be able to identify who composes those individual groups.

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    This is an instance of the Clique Problem and is NP-Complete.
    Here is a related question on SO with a good explanation!

    Sorry I hit enter too soon. So there is no “efficient” way to do this. It is not unattemptable though in certain cases, and you will have the best luck looking for an algorithm that solves this general problem and implementing it in Neo4J.

    • 0