This is a Graph problem, you want to find all joined sub graphs, so i don't think it's easy using Map/Reduce.
but you can try Yarn, it can be iterated easily, at least compared with M/R. On Fri, Jun 14, 2013 at 12:41 PM, parnab kumar <[email protected]>wrote: > Consider a following input file of format : > input File : > 1 2 > 2 3 > 3 4 > 6 7 > 7 9 > 10 11 > > The output Should be as follows : > > 1 2 3 4 > 6 7 9 > 10 11
