Package | Description |
---|---|
org.apache.giraph.benchmark |
Package of benchmarks for performance testing and optimization
|
org.apache.giraph.examples |
Package of Giraph examples.
|
org.apache.giraph.examples.scc |
Classes for Strongly Connected Components computation.
|
Modifier and Type | Class and Description |
---|---|
static class |
AggregatorsBenchmark.AggregatorsBenchmarkComputation
Vertex class for AggregatorsBenchmark
|
class |
PageRankComputation
Implementation of PageRank in which vertex ids are ints, page rank values
are floats, and graph is unweighted.
|
static class |
RandomMessageBenchmark.RandomMessageComputation
Actual message computation (messaging in this case)
|
static class |
ReducersBenchmark.ReducersBenchmarkComputation
Vertex class for ReducersBenchmark
|
class |
ShortestPathsComputation
Shortest paths algorithm.
|
class |
WeightedPageRankComputation
Implementation of Page Rank algorithm on a weighted graph.
|
Modifier and Type | Class and Description |
---|---|
class |
AggregatorsTestComputation
Computation which uses aggrergators.
|
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 |
IdentityComputation<I extends org.apache.hadoop.io.WritableComparable,V extends org.apache.hadoop.io.Writable,E extends org.apache.hadoop.io.Writable,M extends org.apache.hadoop.io.Writable>
User applications can subclass IdentityComputation, which
simply prints the results that have been read for testing IO related
jobs under any inputformat
|
class |
MaxComputation
Simple algorithm that computes the max value in the graph.
|
class |
PageRankWithKryoSimpleWritable
Copy of SimplePageRank, modified to test vertex/edge and
message values that derives from KryoSimpleWritable.
|
class |
RandomWalkComputation<E extends org.apache.hadoop.io.Writable>
Base class for executing a random walk on a graph
|
class |
RandomWalkWithRestartComputation
Executes "RandomWalkWithRestart", a random walk on the graph which is biased
towards a source vertex.
|
static class |
SimpleCheckpoint.SimpleCheckpointComputation
Actual computation.
|
class |
SimpleCombinerComputation
Test whether messages can go through a combiner.
|
class |
SimpleFailComputation
Vertex to allow unit testing of failure detection
|
class |
SimpleInDegreeCountComputation
Simple function to return the out degree for each vertex.
|
class |
SimpleLongDoubleDoubleDoubleIdentityComputation
A simple use of the Identity Vertex for taking care of Long, Double,
Double, Double type Inputformat Good for use with
io.LongDoubleDoubleAdjacencyListVertexInputFormat
|
class |
SimpleMasterComputeComputation
Demonstrates a computation with a centralized part implemented via a
MasterCompute.
|
class |
SimpleMsgComputation
Test whether messages can be sent and received by vertices.
|
class |
SimpleMutateGraphComputation
Vertex to allow unit testing of graph mutations.
|
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.
|
class |
SimpleSuperstepComputation
Just a simple Vertex compute implementation that executes 3 supersteps, then
finishes.
|
class |
SimpleTriangleClosingComputation
Demonstrates triangle closing in simple,
unweighted graphs for Giraph.
|
static class |
SimpleVertexWithWorkerContext.SimpleComputation
Actual vetex implementation
|
class |
TestComputationStateComputation
Vertex to test the local variables in Computation, and pre/postSuperstep
methods
|
static class |
VerifyMessage.VerifyMessageComputation
Send and verify messages.
|
Modifier and Type | Class and Description |
---|---|
class |
SccComputation
Finds strongly connected components of the graph.
|
Copyright © 2011-2020 The Apache Software Foundation. All Rights Reserved.