 02 May, 2012 1 commit


Tiago Peixoto authored

 24 Aug, 2011 1 commit


Tiago Peixoto authored
This introduces several simplifications and corrections to the graph rewire algorithm, to guarantee unbiased sampling. Now a move is outright rejected if it produces a selfloop/paralleledge, instead of retried. This also adds a "nonsweep" mode, where edges are rewired randomly, possibly with repetition. The edge moves are now simplified to the target of the edges only, since swaping sources is redundant. The number of iterations can now be explicitly modified, so it is not necessary to call the function more than once, and it is emphasized in the documentation that only after sufficiently many iterations can the graph be guaranteed to be fully mixed.

 10 Feb, 2011 1 commit


Tiago Peixoto authored

 13 Nov, 2010 1 commit


Tiago Peixoto authored

 25 Jul, 2010 1 commit


Tiago Peixoto authored
This enables support for older versions of GCC (>=4.2), by falling back to the boost tr1 implementation when the GCC version is less than 4.4.

 07 Mar, 2010 1 commit


Tiago Peixoto authored

 20 Feb, 2010 2 commits


Tiago Peixoto authored
Now the degree sequence is verified with ErdösGallai inequalities, and the edges are connected in a deterministic fashion. The edges then are rewired with the random_rewire() function.

Tiago Peixoto authored
This includes also some internal refactoring, and bug fixes.
