search

vtraag / leidenalg

Implementation of the Leiden algorithm for various quality functions to be used with igraph in Python.
GNU General Public License v3.0
566 stars 76 forks source link

Dendrogram retrieval? #176

Open samiMHMD opened 2 months ago

samiMHMD commented 2 months ago

Helloc @vtraag,

Leiden seems to be built like Louvain, in the sense that in the process of finding the best partition the nodes within a community are merged into a metanode, before performing again the nodes mouvment and etc.., here with the metanodes and so on until no improvement on the optimzed function. Like this we form a dendrogram giving a hierarchical representation of the graph with several levels of partitions. Is there a way to recover the dendrogram from the Leiden aglo?

Thanks in advance,

Regards Sami

tiffanycchen commented 2 months ago

I also want this feature/ want to know is there anyway to achieve this. Thanks!

tiffanycchen commented 2 weeks ago

Hi, is there any update on this issue? Thank you!