KarypisLab / METIS

METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering
Other
665 stars 134 forks source link

All vertexes are partitioned into a partition #81

Open Fern-Parker opened 8 months ago

Fern-Parker commented 8 months ago

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?

graph1

Any help will be greatly appreciated!

gfaster commented 8 months ago

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