Neo4j, Graph Algorithms, Pagerank, Network Science, Data Science.
{path: true}) YIELD nodeIds UNWIND nodeIds AS nodeId MATCH (node) WHERE id(node) = nodeId RETURN coalesce(node.name, node.title) AS node Since this algorithm has an element of randomness we’ll get back a different set of nodes than in the first example: By default the algorithm chooses the next