Neo4J : Get all nodes who are connected to at least K nodes with a path length <= 2

Question

With this use case I am finding it to hard with Cypher query. Do I need to write stored procedure for it ?

Answer 1

Here is a query that will return every node that is connected via paths up to length 2 to at least k distinct nodes. k is assumed to be passed as a parameter.

MATCH (n)-[*..2]-(m)
WITH n, COUNT(DISTINCT m) AS ms
WHERE ms > $k
RETURN n, ms;