Copy pasting my code here ... hope thats okay. You can place this in the
giraph examples folder where other examples are present.
You will also need to create an additional "giraph io format" of the form
"JsonDoubleDoubleFloatDoubleVertexInputFormat.java". It takes minor edits
to create such a new
Check out this paper on implementing triangle counting in a BSP model by
Prof David Bader from Georgia Tech.
http://www.cc.gatech.edu/~bader/papers/GraphBSPonXMT-MTAAP2013.pdf
I implemented a similar version in Apache Giraph, and it worked pretty
well. You have to "switch on" the write to disk op
tes to run on a graph with 10K
> vertices and 150K edges, if you have better luck I'd be interested to know.
>
> Hope this helps,
>
> Rob
>
> From: Kaushik Patnaik
> Reply-To:
> Date: Wednesday, 4 December 2013 04:18
> To:
> Subject: Missing chosen worker er
Hi,
I am getting a missing chosen worker error upon running a custom program
(triangle counting) on a graph dataset of about 7K nodes and 200K edges.
The program runs fine on the first two supersteps, but throws a missing
chosen worker error in the third superstep. In the third superstep each
node
race I would guess that
> either you don't have a public constructor or you have one but it is
> expecting arguments. For Giraph (or any Java code) to be able to
> instantiate a new instance of a class in this way there needs to be a
> public constructor with no parameters available
Hi,
I am trying to run a triangle counting computation which I have
written and have setup an input file in the adjacencylist format as
1 1 2 0.3 3 0.1
2 1 2 0.7 6 0.9
.
and provide the following command to run giraph
$HADOOP_HOME/bin/hadoop jar
$GIRAPH_HOME/giraph-examples/target/giraph-
Hi
I am trying to implement a procedure which outputs both the number of
triangles in a graph and enumerates all the triangles for a vertex.
I am able to enumerate triangles for each node in three supersteps by the
following psuedo code
- sending edge information (from -> to) as the message to
