CALL

MATCH nodes = (b)
CALL {
  MATCH path = (a)-[e1:flows_to]->(b)
  return path
    , count(distinct e1) as incoming_nodes_count
    , COLLECT_LIST(distinct a.name) as incoming_nodes
}
return table(b.name, incoming_nodes_count, incoming_nodes)
order by incoming_nodes_count desc;

MATCH nodes = (a)
CALL {
  MATCH path = (a)-[edges:flows_to]->{0,}(b)
  return reduce(path = a._id, edge in edges | path || '->' || edge._to) as route
  , b
  
}
return table(a.name as starting, b.name as ending, route)

MATCH friends = ALL  (account_a)-[:friends]->{0,2}(account_b)
CALL {
  MATCH path = (account_a)-[:watched]->(movie_a)
    , (account_b)-[:watched]->(movie_b)
  FILTER account_a <> account_b and movie_a <> movie_b
  return path
    , COLLECT_LIST(distinct movie_a.title) as recommended_movies
}
FILTER account_a <> account_b
return table(account_a.name, account_b.name, recommended_movies);