Neo4j - 3.5.12
In my project I need to find different paths. I have nodes in my graph database like below
- I want to find all the nodes having connections more than 1.
I got it from getting the relationship count more than 1.
- From that node, find all the possible nodes that can reach that node and get the hop count. The output should be in the format of
G has more than 1 relationship, so
X has 3 relationship, so
and in the above collection, G has 2 relationship
and so on.
I haven't used any apoc procedure.
Appreciate your advance help.