1. 07 Mar, 2010 1 commit
  2. 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
      This also removes the "seed" parameter, which is redundant to
      the numpy.random.seed() function.
  3. 04 Aug, 2009 1 commit
  4. 23 May, 2009 1 commit
  5. 24 Apr, 2009 1 commit
  6. 10 Mar, 2009 1 commit
    • Tiago Peixoto's avatar
      Implement optional wrapping of graphs to deal with edge index housekeeping · 684efca7
      Tiago Peixoto authored
      Thins changes the graph filtering code slightly to wrap graph types with
      GraphWrap, which automatically updates the edge index list when edges
      are removed and added to the graph.
      This also changes how graphs are passed to algorithms, which is now by
      reference instead of pointer. (hence this touches lots of code, but
      changes are trivial)
  7. 09 Mar, 2009 1 commit