hi i just started working on giraph,
started with shortestpath example.
in tiny_graph.txt graph is represented as
[0,0,[[1,1],[3,3]]]
[1,0,[[0,1],[2,2],[3,1]]]
[2,0,[[1,2],[4,4]]]
[3,0,[[0,3],[1,1],[4,4]]]
[4,0,[[3,4],[2,4]]]
from this
format of this input is
[VertexId,VertexValue,[OppositeVertexOfEdge,Edge Value]]
so,
for
[1,0,[[0,1],[2,2],[3,1]]]
VertexId=1
VertexValue=0
there are three edges for VertexId=1
with [0,1] means, Edge has opposite vertexId 0, so Edge is (1,0) and second
part is Edge Value 1.
with [2,2] means,
There are three data attached with the graph
1) Vertex Id: Every vertex has ID. It can be anything. number or string or
object
2) Vertex Value: Every vertex can be assign some value to attached with it.
this value can be number or string or object
3) Edge Value: Every edge can be assign some value
that's a detailed explanation.
thanks nishant.
On Thu, Apr 17, 2014 at 7:50 PM, nishant gandhi
nishantgandh...@gmail.comwrote:
There are three data attached with the graph
1) Vertex Id: Every vertex has ID. It can be anything. number or string or
object
2) Vertex Value: Every vertex can
