Closed twesleyb closed 4 years ago
Hi, this appears to be a bug with the new fixed node feature.
In the meantime, you can install leidenalg==0.7.0
and your example will work
>>> import igraph as ig
>>> import leidenalg as la
>>>
>>> print(la.__version__)
0.7.0
>>>
>>> g0 = ig.Graph.GRG(100, 0.2)
>>> g1 = ig.Graph.GRG(100, 0.1)
>>> membership, improv = la.find_partition_multiplex([g0, g1], la.ModularityVertexPartition)
>>> print(membership)
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 2, 0, 4, 4, 4, 0, 4, 0, 0, 0, 0, 4, 2, 4, 4, 2, 2, 4, 4, 2, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3]
Thanks Ryan, that fixed the issue.
Hi Vincent,
I used the Leiden algorithm in a paper that myself and my colleagues recently submitted to eLife (biorxiv preprint). Thank you for making the
leidenalg
python package!I'm having some trouble when I try to cluster multiplex graphs, maybe you can help (not relevant to that publication).
I'm stuck because calls to
leidenalg.find_partition_multiplex
generates an error:I've tried
find_multiplex_partition
with some dummy graphs:As well as some real graphs with actual data (source).
Both generate the same error:
The
leidenalg
Multiplex documentation usesG_telephone
andG_email
, but without these graphs, I am unable to reproduce the example.Do you recognize this error message? The error message is unhelpful here because
g0
andg1
should contain the same number of nodes in each example.