Neo4j, Graph Algorithms, Pagerank, Network Science, Data Science.
labels(n)[0] AS label, score, [node in nodes(shortestpath((p)-[*]-(n))) | coalesce(node.name, node.title)] AS path ORDER BY score DESC LIMIT 5 This query only returns people that are at least 2 hops away from Keanu Reeves. We’ve added the most basic variant of this algorithm so please let us know