|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||
See:
Description
| Class Summary | |
|---|---|
| AggregatorsTestComputation | Computation which uses aggrergators. |
| AggregatorsTestComputation.AggregatorsTestMasterCompute | Master compute which uses aggregators. |
| 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. |
| GeneratedVertexReader<I extends WritableComparable,V extends Writable,E extends Writable> | Used by GeneratedVertexInputFormat to read some generated data |
| IdentityComputation<I extends WritableComparable,V extends Writable,E extends Writable,M extends Writable> | User applications can subclass IdentityComputation, which simply prints the results that have been read for testing IO related jobs under any inputformat |
| LongDoubleDoubleTextInputFormat | Simple text-based VertexInputFormat for
unweighted graphs with long ids. |
| LongDoubleNullTextInputFormat | Input format for unweighted graphs with long ids and double vertex values |
| NormalizingLongDoubleDoubleTextInputFormat | Simple text-based VertexInputFormat for
unweighted graphs with long ids. |
| PageRankComputation | The PageRank algorithm, with uniform transition probabilities on the edges http://en.wikipedia.org/wiki/PageRank |
| RandomWalkComputation<E extends Writable> | Base class for executing a random walk on a graph |
| RandomWalkVertexMasterCompute | Master compute associated with RandomWalkComputation. |
| RandomWalkWithRestartComputation | Executes "RandomWalkWithRestart", a random walk on the graph which is biased towards a source vertex. |
| RandomWalkWorkerContext | Worker context for random walks. |
| SimpleAggregatorWriter | This is a simple example for an aggregator writer. |
| SimpleCheckpoint | An example that simply uses its id, value, and edges to compute new data every iteration to verify that checkpoint restarting works. |
| SimpleCheckpoint.SimpleCheckpointComputation | Actual computation. |
| SimpleCheckpoint.SimpleCheckpointVertexMasterCompute | Master compute associated with SimpleCheckpoint. |
| SimpleCheckpoint.SimpleCheckpointVertexWorkerContext | Worker context associated with SimpleCheckpoint. |
| SimpleCombinerComputation | Test whether messages can go through a combiner. |
| SimpleFailComputation | Vertex to allow unit testing of failure detection |
| SimpleInDegreeCountComputation | Simple function to return the out degree for each vertex. |
| SimpleLongDoubleDoubleDoubleIdentityComputation | A simple use of the Identity Vertex for taking care of Long, Double, Double, Double type Inputformat Good for use with io.LongDoubleDoubleAdjacencyListVertexInputFormat |
| SimpleMasterComputeComputation | Demonstrates a computation with a centralized part implemented via a MasterCompute. |
| SimpleMasterComputeComputation.SimpleMasterCompute | MasterCompute used with SimpleMasterComputeComputation. |
| SimpleMasterComputeComputation.SimpleMasterComputeWorkerContext | Worker context used with SimpleMasterComputeComputation. |
| SimpleMsgComputation | Test whether messages can be sent and received by vertices. |
| SimpleMutateGraphComputation | Vertex to allow unit testing of graph mutations. |
| SimpleMutateGraphComputation.SimpleMutateGraphVertexWorkerContext | Worker context used with SimpleMutateGraphComputation. |
| SimpleOutDegreeCountComputation | Simple function to return the out degree for each vertex. |
| SimplePageRankComputation | Demonstrates the basic Pregel PageRank implementation. |
| SimplePageRankComputation.SimplePageRankMasterCompute | Master compute associated with SimplePageRankComputation. |
| SimplePageRankComputation.SimplePageRankVertexInputFormat | Simple VertexInputFormat that supports SimplePageRankComputation |
| SimplePageRankComputation.SimplePageRankVertexOutputFormat | Simple VertexOutputFormat that supports SimplePageRankComputation |
| SimplePageRankComputation.SimplePageRankVertexReader | Simple VertexReader that supports SimplePageRankComputation |
| SimplePageRankComputation.SimplePageRankWorkerContext | Worker context used with SimplePageRankComputation. |
| SimpleShortestPathsComputation | Demonstrates the basic Pregel shortest paths implementation. |
| SimpleSuperstepComputation | Just a simple Vertex compute implementation that executes 3 supersteps, then finishes. |
| SimpleSuperstepComputation.SimpleSuperstepVertexInputFormat | Simple VertexInputFormat that supports SimpleSuperstepComputation |
| SimpleSuperstepComputation.SimpleSuperstepVertexOutputFormat | Simple VertexOutputFormat that supports SimpleSuperstepComputation |
| SimpleSuperstepComputation.SimpleSuperstepVertexReader | Simple VertexReader that supports SimpleSuperstepComputation |
| SimpleTextVertexOutputFormat | Simple text based vertex output format example. |
| SimpleTriangleClosingComputation | Demonstrates triangle closing in simple, unweighted graphs for Giraph. |
| SimpleTriangleClosingComputation.IntArrayListWritable | Utility class for delivering the array of vertices THIS vertex should connect with to close triangles with neighbors |
| SimpleTriangleClosingComputation.Pair | Quick, immutable K,V storage for sorting in tree set |
| SimpleVertexWithWorkerContext | Fully runnable example of how to emit worker data to HDFS during a graph computation. |
| SimpleVertexWithWorkerContext.EmitterWorkerContext | Example worker context to emit data as part of a superstep. |
| SimpleVertexWithWorkerContext.SimpleComputation | Actual vetex implementation |
| TestComputationStateComputation | Vertex to test the local variables in Computation, and pre/postSuperstep methods |
| TestComputationStateComputation.TestComputationStateWorkerContext | WorkerContext for TestComputationState |
| VerifyMessage | An example that simply uses its id, value, and edges to compute new data every iteration to verify that messages are sent and received at the appropriate location and superstep. |
| VerifyMessage.VerifiableMessage | Message that will be sent in VerifyMessage.VerifyMessageComputation. |
| VerifyMessage.VerifyMessageComputation | Send and verify messages. |
| VerifyMessage.VerifyMessageComputation.VerifyMessageVertexWorkerContext | Worker context used with VerifyMessage.VerifyMessageComputation. |
| VerifyMessage.VerifyMessageMasterCompute | Master compute associated with VerifyMessage.VerifyMessageComputation. |
| VertexWithDoubleValueDoubleEdgeTextOutputFormat | Simple vertex output format for weighted graphs. |
| VertexWithDoubleValueNullEdgeTextOutputFormat | Output format for vertices with a long as id, a double as value and null edges |
| Annotation Types Summary | |
|---|---|
| Algorithm | This annotation should be used to annotate built-in algorithms. |
Package of Giraph examples.
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES | |||||||||