Comment 12 for bug 404256

Hi Tomas,
  Ok, I applied the patch against linux 64-bit and it now passes the break.py attachment I uploaded earlier (as well as the 4-star as you tested).

  I decided to test this against the random model that first produced the bug report. I get through about 100-200 random graphs before an error now, which is much better than the 5-10 I was seeing prior to the patch.

Traceback (most recent call last):
  File "model1.py", line 91, in <module>
    m.run(50)
  File "model1.py", line 65, in run
    communityEV[self.time] = gg.community_leading_eigenvector().membership
  File "/usr/lib/python2.6/dist-packages/igraph/__init__.py", line 540, in community_leading_eigenvector
    cl, merges = GraphBase.community_leading_eigenvector(self, clusters, return_merges)
igraph.core.InternalError: Error at community.c:1185: , Maximum number of iterations reached

Undirected graph (|V| = 10, |E| = 15)
[(0, 1), (0, 2), (0, 3), (0, 6), (1, 6), (1, 7), (2, 4), (2, 5), (2, 7), (3, 7), (3, 9), (4, 6), (4, 7), (5, 6), (5, 8)]

So it looks much better. I might just catch these particularly nasty graphs and accept some sampling bias in my model.

In case you're curious, I'll dump a few of these. They almost all appear for early time steps for slowly growing graphs:
[(1, 0), (2, 0), (2, 1), (3, 0), (3, 1), (4, 0), (4, 1), (5, 1), (5, 0)]
[(1, 0), (2, 0), (2, 1), (3, 1), (3, 0), (4, 1), (4, 0)]
[(1, 0), (2, 0), (3, 0), (4, 2), (4, 0), (4, 3), (4, 1)]
[(1, 0), (2, 0), (3, 1), (3, 0), (3, 2), (4, 2), (4, 1), (4, 0)]
[(1, 0), (2, 0), (3, 1), (3, 2), (4, 1), (4, 2), (4, 3), (4, 0)]
[(1, 0), (2, 1), (2, 0), (3, 0), (3, 1), (4, 0), (4, 1)]
[(1, 0), (2, 1), (2, 0), (3, 0), (3, 1), (4, 0), (4, 2), (4, 3)]
[(1, 0), (2, 1), (2, 0), (3, 0), (3, 1), (4, 1), (4, 0)]
[(1, 0), (2, 1), (2, 0), (3, 0), (3, 2), (4, 0), (4, 2)]