For example: Edge (1, 2) belong to the partition 1; Edge (2, 3) input partition 2
So logical node 2 exists in two different partition, how to quickly find out all these nodes?
I now use the method is to use partitionWithIndex first the partition number marking on each side, and then use the aggregateMessages will number sent to the corresponding node, if one node number (distinct) is greater than 1, then the node for the cross are drawn, but the efficiency of this method is very low,
A great god, please see if there are any quick method can be implemented?
CodePudding user response:
Routing table records the vertices to division, through the routing table,