首页>
外国专利>
Probabilistically finding the connected components of an undirected graph
Probabilistically finding the connected components of an undirected graph
展开▼
机译:概率性地找到无向图的连通部分
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method for probabilistically finding the connected components of an undirected graph. The method includes identifying a first edge, having a first and second vertex, and inserting information detailing the first and second vertex of the first edge into a bloom filter associated with a root node of a bloom filter data structure. A first node, connected to the root node, is created, comprising an associated bloom filter containing information associated with the first and second vertex of the first edge. The method includes identifying a second edge, having a first and second vertex, and inserting information detailing the first and second vertex of the second edge into a bloom filter associated with the root node of the bloom filter data structure. A second node, connected to the root node, is created, comprising an associated bloom filter containing information associated with the first and second vertex of the second edge.
展开▼