1. 28 Aug, 2020 1 commit
  2. 07 Jul, 2020 1 commit
    • Jeff Trull's avatar
      Mass conversion of bind() calls to lambdas · 4c3b87a8
      Jeff Trull authored
      Source file work done with custom-modified versions of clang-format
      and clang-tidy, via the modernize-avoid-bind checker. Headers were
      modified by hand. A script removed uses of <functional> and <boost/bind.hpp>.
      4c3b87a8
  3. 08 Jun, 2020 1 commit
  4. 02 Jun, 2020 1 commit
  5. 22 Mar, 2020 1 commit
  6. 05 Jun, 2019 1 commit
  7. 20 Sep, 2018 1 commit
  8. 14 Feb, 2018 1 commit
  9. 01 Feb, 2018 1 commit
  10. 19 Nov, 2017 1 commit
  11. 28 Sep, 2017 1 commit
  12. 01 Jan, 2017 1 commit
  13. 04 Dec, 2016 1 commit
  14. 01 Nov, 2016 1 commit
  15. 26 Oct, 2016 1 commit
  16. 05 Aug, 2016 1 commit
  17. 27 Jul, 2016 1 commit
  18. 18 Jul, 2016 1 commit
  19. 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
  20. 01 Jan, 2016 1 commit
  21. 20 Aug, 2015 1 commit
  22. 08 Jan, 2015 1 commit
  23. 08 Dec, 2014 1 commit
  24. 09 Sep, 2014 1 commit
  25. 02 Jan, 2014 1 commit
  26. 28 Dec, 2013 1 commit
  27. 21 Dec, 2013 1 commit
  28. 10 Nov, 2013 1 commit
  29. 15 Jul, 2013 1 commit
  30. 25 Apr, 2013 1 commit
  31. 06 Jan, 2013 1 commit
  32. 26 Dec, 2012 1 commit
  33. 02 May, 2012 1 commit
  34. 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
  35. 10 Feb, 2011 1 commit
  36. 13 Nov, 2010 1 commit
  37. 25 Jul, 2010 1 commit
  38. 07 Mar, 2010 1 commit
  39. 20 Feb, 2010 2 commits