1. 21 Nov, 2009 1 commit
  2. 20 Nov, 2009 1 commit
  3. 09 Nov, 2009 4 commits
  4. 06 Nov, 2009 2 commits
  5. 05 Nov, 2009 7 commits
  6. 04 Nov, 2009 1 commit
  7. 23 Oct, 2009 5 commits
  8. 17 Oct, 2009 2 commits
  9. 12 Oct, 2009 1 commit
  10. 09 Oct, 2009 1 commit
  11. 05 Oct, 2009 6 commits
  12. 03 Oct, 2009 1 commit
  13. 18 Sep, 2009 4 commits
  14. 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
  15. 07 Sep, 2009 1 commit
  16. 06 Sep, 2009 2 commits