thanks nishant,
everything is clear except that vertex value.
i am trying to understand the execution flow of shortestpath example where
it starts and where it ends.
can you help me with it.
On Thu, Apr 17, 2014 at 3:25 PM, nishant gandhi
<nishantgandhi99@gmail.com>wrote:
> 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, Edge has opposite vertexId 2, so Edge is (1,2) and
> second part is Edge Value 2.
> with [3,1] means, Edge has opposite vertexId 3, so Edge is (1,3) and
> second part is Edge Value 1.
> Hope that Helps.
>
> Nishant Gandhi
> M.Tech. CSE
> IIT Patna
>
>
> On Thu, Apr 17, 2014 at 3:10 PM, yeshwanth kumar <yeshwanth43@gmail.com>wrote:
>
>> 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 image<http://blog.cloudera.com/wpcontent/uploads/2014/01/giraph3.png>
somehow
>> i understood the representation.
>> but its not clear totally.
>>
>> from [0,*0*,[[1,1],[3,3]]]
>>
>> it mean it got edges between (0,1) and weight of edge is 1 and (0,3) and
>> weight of edge is 3. what does second 0 stands for.
>> does it mean there's no cycle between (0,0)
>> can someone explain how graph is represented.
>>
>> thank you.
>>
>>
>
