[ 
https://issues.apache.org/jira/browse/GIRAPH-115?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13175889#comment-13175889
 ] 

Hudson commented on GIRAPH-115:
-------------------------------

Integrated in Giraph-trunk-Commit #59 (See 
[https://builds.apache.org/job/Giraph-trunk-Commit/59/])
    GIRAPH-115: Port of the HCC algorithm for identifying all connected
components of a graph. (ssc via aching)

aching : http://svn.apache.org/viewcvs.cgi/?root=Apache-SVN&view=rev&rev=1224678
Files : 
* /incubator/giraph/trunk/CHANGELOG
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/examples/ConnectedComponentsVertex.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/examples/IntIntNullIntTextInputFormat.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/examples/MinimumIntCombiner.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/examples/VertexWithComponentTextOutputFormat.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/graph/IntIntNullIntVertex.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/utils/InternalVertexRunner.java
* 
/incubator/giraph/trunk/src/main/java/org/apache/giraph/utils/UnmodifiableIntArrayIterator.java
* 
/incubator/giraph/trunk/src/test/java/org/apache/giraph/examples/ConnectedComponentsVertexTest.java
* 
/incubator/giraph/trunk/src/test/java/org/apache/giraph/examples/MinimumIntCombinerTest.java
* 
/incubator/giraph/trunk/src/test/java/org/apache/giraph/examples/SimpleShortestPathVertexTest.java

                
> Port of the HCC algorithm for identifying all connected components of a graph
> -----------------------------------------------------------------------------
>
>                 Key: GIRAPH-115
>                 URL: https://issues.apache.org/jira/browse/GIRAPH-115
>             Project: Giraph
>          Issue Type: New Feature
>    Affects Versions: 0.70.0
>            Reporter: Sebastian Schelter
>
> Port of the HCC algorithm that identifies connected components and assigns a 
> componented id (the smallest vertex id in the component) to each vertex.
> The idea behind the algorithm is very simple: propagate the smallest vertex 
> id along the edges to all vertices of a connected component until 
> convergence. The number of supersteps necessary is equal to the length of the 
> maximum diameter of all components + 1
> The original Hadoop-based variant of this algorithm was proposed by Kang, 
> Charalampos, Tsourakakis and Faloutsos in "PEGASUS: Mining Peta-Scale 
> Graphs", 2010
> http://www.cs.cmu.edu/~ukang/papers/PegasusKAIS.pdf

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: 
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira

        

Reply via email to