Package | Description |
---|---|
org.apache.giraph.examples |
Package of Giraph examples.
|
Modifier and Type | Class and Description |
---|---|
class |
BrachaTouegDeadlockComputation
This code demonstrates the Bracha Toueg deadlock detection algorithm.
|
class |
ConnectedComponentsComputation
Implementation of the HCC algorithm that identifies connected components and
assigns each vertex its "component identifier" (the smallest vertex id
in the component)
The idea behind the algorithm is very simple: propagate the smallest
vertex id along the edges to all vertices of a connected component.
|
class |
PageRankWithKryoSimpleWritable
Copy of SimplePageRank, modified to test vertex/edge and
message values that derives from KryoSimpleWritable.
|
class |
SimpleInDegreeCountComputation
Simple function to return the out degree for each vertex.
|
class |
SimpleOutDegreeCountComputation
Simple function to return the out degree for each vertex.
|
class |
SimplePageRankComputation
Demonstrates the basic Pregel PageRank implementation.
|
class |
SimpleShortestPathsComputation
Demonstrates the basic Pregel shortest paths implementation.
|
Copyright © 2011-2020 The Apache Software Foundation. All Rights Reserved.