Connected-Components-in-Distributed-Memory

Used opportunistic pointer jumping and tree hanging technique to find the number of connected components in a large undirected graph (Graph is too large to be represented in the memory of a single compute node)

Built With

Share this project:

Updates