All vertexes are partitioned into a partition

[Fern-Parker]

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!

[gfaster]

are you able to share the parameters you pass into it? This graph is definitely not too complicated.