Counting path of nodes between nodes

Labels: "RED_NODE", "YELLOW_NODE", "GREEN_NODE"
Properties: id (1,2,3...), name ('This one', 'this other one',...), type (=label)

I wish to count the nodes from the red node onwards.

I wish to count the nodes from the red node and all connected nodes in any path

I wish to count only the nodes from the red node with name="this is the first" and not the nodes connected to the red node with the name="not this one"

So the desired output should be:
Nodes connected to "this is the first" = 12
Nodes connected to "not this one" = 4

Hello @VilladsClaes :slight_smile:

Without to know labels and propeties, I cannot write a query that fits your need but I can give you an algorithm:

MATCH path=(...)
RETURN start_node, size(nodes(path))

Regards,
Cobra

Something like this should solve your issue :slight_smile:

MATCH (a:RED_NODE)-[*]->(b)
RETURN a.name AS name, count(b) AS nb_nodes

Regards,
Cobra

Try this:

//Nodes connected to "this is the first"....

match (d:RED_NODE) where d.id = 1  
CALL apoc.neighbors.athop(d, ">|<", 10) YIELD node
with count(node) as lvl10
RETURN lvl10

//Nodes connected to "not this one"

match (d:RED_NODE) where d.id = 2  
CALL apoc.neighbors.athop(d, ">|<", 4) YIELD node
with count(node) as lvl4
RETURN lvl4