1. A system for finding connected components in a graph comprising: an input device that receives a list of edges in the graph; a distributed processing arrangement coupled to the input device, the distributed processing arrangement including a plurality of processors that execute, in a distributed fashion, an iterative process that generates adjacency for each known node in the graph; the distributed processing arrangement further deduplicates: wherein the output of the deduplicating comprises a mapping from each node in the graph to a corresponding component identifier.