1. 23 Oct, 2009 1 commit
  2. 12 Oct, 2009 1 commit
  3. 05 Oct, 2009 1 commit
  4. 03 Oct, 2009 1 commit
  5. 18 Sep, 2009 4 commits
  6. 12 Sep, 2009 1 commit
    • Tiago Peixoto's avatar
      Speed up motifs() and motif_significance() · 06b2914a
      Tiago Peixoto authored
      In both functions we can save some time by hashing the subgraphs found,
      according to their degree distribution signature (instead of number of
      edges). This avoids a large number of useless exactness or isomorphism
      comparisons.
      
      This also removes the "seed" parameter, which is redundant to
      the numpy.random.seed() function.
      06b2914a
  7. 07 Sep, 2009 1 commit
  8. 06 Sep, 2009 3 commits
  9. 05 Sep, 2009 4 commits
  10. 03 Sep, 2009 6 commits
  11. 01 Sep, 2009 1 commit
  12. 27 Aug, 2009 1 commit
  13. 22 Aug, 2009 1 commit
  14. 21 Aug, 2009 4 commits
  15. 17 Aug, 2009 3 commits
  16. 16 Aug, 2009 4 commits
  17. 13 Aug, 2009 2 commits
  18. 09 Aug, 2009 1 commit
    • Tiago Peixoto's avatar
      Modify absolute_trust() algorithm · 54f5c469
      Tiago Peixoto authored
      Path sampling is done using different bias, and the edge sampling is now
      done correctly. There is now only one parameter 'n_iter' which replaces
      'min/max_iter' and 'epslon'.
      54f5c469