[
https://issues.apache.org/jira/browse/GIRAPH-931?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14111216#comment-14111216
]
Hudson commented on GIRAPH-931:
-------------------------------
FAILURE: Integrated in Giraph-trunk-Commit #1483 (See
[https://builds.apache.org/job/Giraph-trunk-Commit/1483/])
GIRAPH-931: Provide a Strongly Connected Components algorithm (gianluca via
majakabiljo) (majakabiljo:
http://git-wip-us.apache.org/repos/asf?p=giraph.git&a=commit&h=de0efb07518082439b9a5cccd503270b09f40e84)
*
giraph-examples/src/main/java/org/apache/giraph/examples/scc/SccVertexValue.java
*
giraph-examples/src/test/java/org/apache/giraph/examples/scc/SccComputationTestInMemory.java
*
giraph-examples/src/main/java/org/apache/giraph/examples/scc/SccComputation.java
*
giraph-examples/src/main/java/org/apache/giraph/examples/scc/SccLongLongNullTextInputFormat.java
* giraph-examples/pom.xml
* giraph-examples/src/main/java/org/apache/giraph/examples/scc/package-info.java
*
giraph-examples/src/main/java/org/apache/giraph/examples/scc/SccPhaseMasterCompute.java
* CHANGELOG
> 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.2#6252)
