Generating many partitions.

[wild-water]

Hello, is it possible to get many partitions, i.e save all good partitions found during search process?

[SebastianSchlag]

Hey @wild-water, thanks for reaching out. Right now, KaHyPar only reports a single solution (the best one it found) as a result of the partitioning process.

In principle, we could output the intermediate solutions during the uncoarsening phase together with a mapping of the form "coarse vertex -> the vertices of the input hypergraph the coarse vertex represents". This way, you could actually get the partitioning hierarchy as an output. This, however, is not directly supported and since KaHyPar uses n-level partitioning, you might get a lot of partitions that are very similar (since only a single vertex gets contracted/uncontracted in each level).

[erupnik]

Hi Team,

I was wondering if access to the intermediate solutions during coarsening/uncoarsening or the community detection has been implemented? I don't think it is available via the C API, but if it was, that would be fantastic.

Thanks!

[SebastianSchlag]

Hi @erupnik,

we haven't implemented this yet as a proper feature, unfortunately.