You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@giraph.apache.org by "Maja Kabiljo (JIRA)" <ji...@apache.org> on 2014/10/10 22:00:34 UTC

[jira] [Resolved] (GIRAPH-931) Provide a Strongly Connected Components algorithm

     [ https://issues.apache.org/jira/browse/GIRAPH-931?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Maja Kabiljo resolved GIRAPH-931.
---------------------------------
    Resolution: Fixed

> 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, GIRAPH-931.v3.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.3.4#6332)