flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "ASF GitHub Bot (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-4896) PageRank algorithm for directed graphs
Date Mon, 31 Oct 2016 18:07:59 GMT

    [ https://issues.apache.org/jira/browse/FLINK-4896?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15622894#comment-15622894

ASF GitHub Bot commented on FLINK-4896:

GitHub user greghogan opened a pull request:


    [FLINK-4896] [gelly] PageRank algorithm for directed graphs


You can merge this pull request into a Git repository by running:

    $ git pull https://github.com/greghogan/flink 4896_pagerank_algorithm_for_directed_graphs

Alternatively you can review and apply these changes as the patch at:


To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:

    This closes #2733
commit bddc6437c3202ee981f0eeeaa684e5ac4274d23a
Author: Greg Hogan <code@greghogan.com>
Date:   2016-10-24T20:14:16Z

    [FLINK-4896] [gelly] PageRank algorithm for directed graphs


> 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
> 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

View raw message