search

neo4j-contrib / neo4j-graph-algorithms

Efficient Graph Algorithms for Neo4j
https://github.com/neo4j/graph-data-science/
GNU General Public License v3.0
769 stars 195 forks source link

Support undirected PageRank #845

Closed szarnyasg closed 5 years ago

szarnyasg commented 5 years ago

I am working to implement the LDBC Graphalytics workload using the Graph algorithms library. This requires implementing the undirected variant of PageRank (PR).

The specification defines PR as follows:

image

The example graph and the expected output are listed in the Graphalytics repository as pr/undir-input and pr/undir-output.

It's worth noting that most graphs in the basic Graphalytics data set are undirected (29 out of 33):

ag 'directed = false' -l | wc -l
29
tomasonjo commented 5 years ago

We already support undirected pageRank. I just updated the docs yesterday https://github.com/neo4j-contrib/neo4j-graph-algorithms/commit/aaf6a2c6c336cae9eda0d351151e6734907ff48b. You need to use direction:'BOTH' when treating the graph as undirected

szarnyasg commented 5 years ago

Indeed, there is support for undirected PageRank. Thanks!