Hi, @karypis
I tried to partition a graph, and part of this graph is demonstrated as follows . Assume the number of partitions is N. All vertexes are always partitioned into partition N-1 (numbering from 0). How could I do, is this graph two complicated?
Hi, @karypis I tried to partition a graph, and part of this graph is demonstrated as follows . Assume the number of partitions is N. All vertexes are always partitioned into partition N-1 (numbering from 0). How could I do, is this graph two complicated?
Any help will be greatly appreciated!