[
https://issues.apache.org/jira/browse/FLINK-4896?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15889637#comment-15889637
]
ASF GitHub Bot commented on FLINK-4896:
---------------------------------------
Github user vasia commented on the issue:
https://github.com/apache/flink/pull/2733
Thanks for the results @greghogan! Updating the docs would be nice,
otherwise +1.
Do you think we should move existing implementations in the examples (there
are still relevant to demonstrate iteration APIs) and keep this one as the only
library method since it's the fastest and more general one?
> PageRank algorithm for directed graphs
> --------------------------------------
>
> Key: FLINK-4896
> URL: https://issues.apache.org/jira/browse/FLINK-4896
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Affects Versions: 1.2.0
> Reporter: Greg Hogan
> Assignee: Greg Hogan
> Labels: algorithm
> Fix For: 1.3.0
>
>
> Gelly includes PageRank implementations for scatter-gather and
> gather-sum-apply. Both ship with the warning "The implementation assumes that
> each page has at least one incoming and one outgoing link."
> PageRank is a directed algorithm and sources and sinks are common in directed
> graphs.
> Sinks drain the total score across the graph which affects convergence and
> the balance of the random hop (convergence is not currently a feature of
> Gelly's PageRanks as this a very recent feature from FLINK-3888).
> Sources are handled nicely by the algorithm highlighted on Flink's features
> page under "Iterations and Delta Iterations" since score deltas are
> transmitted and a source's score never changes (is always equal to the random
> hop probability divided by the vertex count).
> https://flink.apache.org/features.html
> We should find an implementation featuring convergence and unrestricted
> processing of directed graphs and move other implementations to Gelly
> examples.
--
This message was sent by Atlassian JIRA
(v6.3.15#6346)
