[
https://issues.apache.org/jira/browse/GIRAPH-931?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14096053#comment-14096053
]
Gianluca Righetto commented on GIRAPH-931:
------------------------------------------
By the way, I just tried to submit a review request on Arcanist, but it doesn't
seem to be public (the "Create new" button is disabled), so I created the
request here: https://reviews.apache.org/r/24665/
> Provide a Strongly Connected Components algorithm
> -------------------------------------------------
>
> Key: GIRAPH-931
> URL: https://issues.apache.org/jira/browse/GIRAPH-931
> Project: Giraph
> Issue Type: Improvement
> Components: examples
> Reporter: Gianluca Righetto
> Priority: Minor
> Attachments: GIRAPH-931.patch, GIRAPH-931.v2.patch
>
>
> Provide an implementation of an algorithm for finding strongly connected
> components in a graph to augment the giraph-examples library. This has been
> initially proposed on GSoC'14.
> A handful of graph algorithms have been researched in this paper: "Optimizing
> Graph Algorithms on Pregel-like Systems" (Salihoglu, S., Widom, J., 2014),
> and a detailed explanation of SCC can also be found in it.
--
This message was sent by Atlassian JIRA
(v6.2#6252)
