common-node | Synchronous CommonJS compatibility layer | Runtime Evironment library

I've migrated my relational database to neo4j and am studying whether I can implement some functionalities before I commit to the new system. I just read two neo4j books, but unfortunately they don't cover two key features I was hoping would be more self-evident. I'd be most grateful for some quick advice on whether these things will be easy to implement or whether I should stick to sql! Thx!

Features I need are: 1) I have run a script to assign :leaf label to all nodes that are leaves in my tree. In paths between a known node and its related leaf nodes, I aim to assign to every node a level property that reflects how many hops that node is from the known node (or leaf node - whatever I can get to work most easily).

I tried: match path=(n:Leaf)-[:R*]->(:Parent {Parent_ID: $known_value}) with n, length(nodes(path)) as hops set n.Level2=hops;

and path=(n:Leaf)-[:R*]->(:Parent {Parent_ID: $known_value}) with n, path, length(nodes(path)) as hops foreach (n IN relationships (path) | set n.Level=hops);

The first assigns property with value of full length of path to only leaf nodes. The second assigns property with value of full length of path to all relationships in path.

Should I be using shortestpath instead, create a bogus property with value =1 for all nodes and iteratively add weight of that property?

2) I need to find the common children for a given parent node. For example, my children each [:like] lots of movies, and I would like to create [:like] relationships from myself to just the movies that my children all like in common (so if 1 of 1 likes a movie, then I like it too, but if only 2 of 3 like a movie, nothing happens).

I found a solution with three paths here: Need only common nodes across multiple paths - Neo4j Cypher But I need a solution that works for any number of paths (starting from 1).

3) Then I plan to start at my furthest leaf nodes, create relationships to children's movies, and move level by level toward my known node and repeat create relationships, so that the top-most grandparent likes only the movies that all children [of all children of all children...] like in common and if there's one that everybody agrees on, that's the movie the entire extended family will watch Saturday night.

Can this be done with neo4j and how hard a task is it for someone with rudimentary Cypher? This is mostly how I did it in my relational database / Should I be looking at implementing this totally differently in graph database?

Most grateful for any advice. Thanks!