1. 28 Sep, 2017 1 commit
  2. 01 Jan, 2017 1 commit
  3. 04 Dec, 2016 1 commit
  4. 10 Sep, 2016 1 commit
  5. 24 May, 2016 1 commit
  6. 03 May, 2016 1 commit
  7. 01 Apr, 2016 1 commit
    • Tiago Peixoto's avatar
      Refactor 'community' module and rename to 'inference' · 41471e3c
      Tiago Peixoto authored
      This is a significant refactoring of the statistical inference code,
      with many cleanups and improvements, and is aimed towards future
      extensibility.
      
      The old community module is available as 'community_old' and will be
      completely removed in the near future.
      41471e3c
  8. 01 Jan, 2016 1 commit
  9. 23 Dec, 2015 1 commit
  10. 13 Sep, 2015 1 commit
  11. 08 Jan, 2015 1 commit
  12. 31 May, 2014 1 commit
    • Tiago Peixoto's avatar
      Force simultaneous filtering of vertex and edges · 3d2ea9f7
      Tiago Peixoto authored
      Now, if either vertex or edge filtering is enabled, simultaneous
      filtering is activated. By not considering vertex or edge filtering in
      completely independent fashion, the compile time memory requirements
      reduced to about 50%.
      3d2ea9f7
  13. 14 Mar, 2014 1 commit
  14. 02 Jan, 2014 1 commit
  15. 28 Dec, 2013 1 commit
  16. 21 Dec, 2013 1 commit
  17. 10 Nov, 2013 1 commit
  18. 25 Apr, 2013 1 commit
  19. 13 Apr, 2013 2 commits
  20. 11 Feb, 2013 1 commit
  21. 06 Jan, 2013 1 commit
  22. 26 Dec, 2012 1 commit
  23. 02 May, 2012 1 commit
  24. 29 Apr, 2012 2 commits
  25. 26 Aug, 2011 1 commit
  26. 24 Aug, 2011 1 commit
    • Tiago Peixoto's avatar
      Several improvements to random_rewire() / random_graph() · 8240714e
      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
      self-loop/parallel-edge, instead of retried. This also adds a
      "non-sweep" 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.
      8240714e
  27. 10 Feb, 2011 1 commit
  28. 13 Nov, 2010 2 commits
  29. 04 Oct, 2010 1 commit
  30. 03 May, 2010 1 commit
  31. 07 Mar, 2010 1 commit
  32. 20 Feb, 2010 1 commit
    • Tiago Peixoto's avatar
      Refactor random_graph() · 1f28345e
      Tiago Peixoto authored
      Now the degree sequence is verified with Erdös-Gallai inequalities, and
      the edges are connected in a deterministic fashion. The edges then are
      rewired with the random_rewire() function.
      1f28345e
  33. 10 Jan, 2010 1 commit
  34. 06 Dec, 2009 1 commit
  35. 06 Sep, 2009 1 commit
  36. 27 Aug, 2009 1 commit
  37. 21 Aug, 2009 1 commit
    • Tiago Peixoto's avatar
      Dump lambda::bind in favor of boost::bind · 7fb5d71d
      Tiago Peixoto authored
      This is a large commit which replaces lambda::bind with boost::bind in
      most parts of the code. This improves compilation time, and slightly
      decreases compilation memory usage in some cases.
      7fb5d71d