在大型数据集中查找连接的组件时可以使用哪些数据结构选项？

Question

let's say we have a HashMap with for a graph with node and adjacency list

HashMap[node:Long,compId:Long, neighbours:Set[Long])]

what is the best way to update all the nodes with the minimum compId(connected component id) and what is the best data structure that can be used when the size of the data is large?

Answer 1

仅使用不相交的集合数据结构，通常情况下，摊销的复杂度将为O（1），非常快！