"- A map task receives a node n as a key, and (D, points-to) as its value" <IntWritable, IntArrayWritable> The 1st element of value is a Distance, 2nd is the size of edges, and edge list. Sent from my iPhone
On Dec 26, 2012, at 6:21 PM, "狼侠" <[email protected]> wrote: > Thanks,what do the input data of your program? like > > > > > ------------------ 原始邮件 ------------------ > 发件人: "Edward"<[email protected]>; > 发送时间: 2012年12月26日(星期三) 下午4:01 > 收件人: "[email protected]"<[email protected]>; > > 主题: Re: sssp in mapreduce > > > > http://blog.udanax.org/2009/02/breadth-first-search-mapreduce.html?m=1 > > Sent from my iPhone > > On Dec 26, 2012, at 4:44 PM, "狼侠" <[email protected]> wrote: > >> Hi, I want to compare the sssp algorithm run in Hama with it run in >> mapreduce.Do someone have a sssp program that use mapreduce to realize?
