1. 04 Oct, 2010 1 commit
  2. 03 Oct, 2010 2 commits
  3. 09 Aug, 2010 1 commit
  4. 30 Jul, 2010 1 commit
  5. 28 Jul, 2010 1 commit
  6. 25 Jul, 2010 1 commit
  7. 13 Jul, 2010 2 commits
    • Tiago Peixoto's avatar
      Change histogram binning semantics · 31791c81
      Tiago Peixoto authored
      Now the meaning of the bin edges given to the several histogram
      functions are the same as in numpy/scipy. This means that the last bin
      edge represents an upper bound on the last bin.
      31791c81
    • Tiago Peixoto's avatar
      Fix segfault bug in motifs() · e75cf856
      Tiago Peixoto authored
      This fixes a bug in the motifs() code which generates a segfault for
      certain subgraph signatures. This also fixes a potential problem for
      multithreaded execution.
      e75cf856
  8. 08 Jul, 2010 1 commit
  9. 06 Jul, 2010 1 commit
  10. 06 Jun, 2010 1 commit
  11. 22 May, 2010 1 commit
  12. 21 May, 2010 3 commits
  13. 20 May, 2010 1 commit
  14. 11 May, 2010 1 commit
  15. 03 May, 2010 4 commits
  16. 07 Mar, 2010 1 commit
  17. 20 Feb, 2010 3 commits
    • 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
    • Tiago Peixoto's avatar
      Include probabilistic random_rewire() strategy · 64cb52b3
      Tiago Peixoto authored
      This includes also some internal refactoring, and bug fixes.
      64cb52b3
    • Tiago Peixoto's avatar
      Refactor random_rewire() · b678e65a
      Tiago Peixoto authored
      This extensively modifies the random_rewire() algorithm, so that only
      either the source or the edge of each edge is rewired (not both, as
      previously), and no parallel edges are created during the algorithm (if
      desired).
      
      The new version is much faster, and never gets stuck. However, more than
      one run may be necessary in order to obtain a uniform shuffling.
      b678e65a
  18. 14 Feb, 2010 1 commit
  19. 08 Feb, 2010 1 commit
    • Tiago Peixoto's avatar
      Fix rewiring bias bug for undirected graphs · d158af8f
      Tiago Peixoto authored
      This fixes a problem, where the underlying edge directionality would
      cause correlations to arise when rewiring undirected graphs. Now each
      edge is correctly considered in both possible orientations, which are
      chosen randomly.
      d158af8f
  20. 04 Feb, 2010 2 commits
  21. 28 Jan, 2010 2 commits
  22. 25 Jan, 2010 1 commit
  23. 10 Jan, 2010 1 commit
  24. 23 Dec, 2009 1 commit
    • Tiago Peixoto's avatar
      Relax boost version requirements · 154ef865
      Tiago Peixoto authored
      This allows compilation with older versions of boost (>=1.38), which in
      some sistems are the only option. This commit also removes the linking
      of the boost_graph shared library, since none of its symbols are
      actually required.
      154ef865
  25. 22 Dec, 2009 1 commit
  26. 14 Dec, 2009 1 commit
  27. 06 Dec, 2009 3 commits