vtraag
commented
2 years ago The returned partition is based on the VertexClustering of igraph, you can check the documentation here: https://igraph.org/python/api/latest/igraph.clustering.VertexClustering.html.
In essence, you can get the list of the individual membership of each node using partition.membership. That is, if partition.membership[i] == c this indicates that node i belongs to community c. You can also index the partition directly, i.e. partition[c] gives you the list of nodes that belong to community c.
Hopefully this provides you enough to go on? I'll see if I can improve the documentation of leidenalg and point to the igraph documentation.
GENETAY
when I use the first command in the introduction
partition = la.find_partition(G, la.ModularityVertexPartition)the variable partition is not (easily) usable. I don't manage it.: input:
partitionoutput:<leidenalg.VertexPartition.ModularityVertexPartition at 0x7f1fb751d4c0>How to use it? I've read the source code and I've check the methods of the class of the variable "partition" without success.
I want something comparable to networkx, a dictionary of nodes with corresponding community, or something like a list with communities of points in the same order as nodes.