1. 15 Jul, 2009 3 commits
    • Tiago Peixoto's avatar
      Improve correlated graph generation · e1dd1665
      Tiago Peixoto authored
      random_graph() now uses a modified algorithm for generation of
      correlated graphs, which is more efficient. Instead of giving a function
      which returns a sample of the correlated target degree, the user must
      give a function which will just compute its probability. This
      probability will then be used to choose the edges.
    • Tiago Peixoto's avatar
      Fix variance of scalar_assortativity() · 6c77669e
      Tiago Peixoto authored
      This also simplifies the calculation of the coefficient.
    • Tiago Peixoto's avatar
      Ongoing documentation improvement · 7da1f0a9
      Tiago Peixoto authored
      This modified several docstrings and introduces a quick-start guide.
  2. 11 Jun, 2009 1 commit
  3. 02 Jun, 2009 2 commits
  4. 23 May, 2009 5 commits
  5. 15 May, 2009 2 commits
  6. 11 May, 2009 6 commits
  7. 08 May, 2009 3 commits
  8. 26 Apr, 2009 2 commits
  9. 25 Apr, 2009 4 commits
  10. 24 Apr, 2009 3 commits
  11. 22 Apr, 2009 1 commit
    • Tiago Peixoto's avatar
      Merge branch 'no-conversions' · de3f34f5
      Tiago Peixoto authored
  12. 16 Apr, 2009 1 commit
  13. 14 Apr, 2009 3 commits
  14. 10 Mar, 2009 2 commits
    • Tiago Peixoto's avatar
      Fix graph_rewire "can't rewire" bug · 6defdb43
      Tiago Peixoto authored
      This finally fixes in the bug addressed by commit 309ddbbd, where
      parallel edges could be erroneously created. In fact, the bug was more
      serious: The source and target edge lists always pointed to the same
      list (in the uncorrelated case, but could occasionally happen for the
      correlated case also) which got shuffled during iteration. Since the
      shuffling of one list interfered with the shuffling of the other, some
      combinations of source and target edges could simply never be
      considered... This commit forces both lists to always be independent.
    • 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)
  15. 09 Mar, 2009 2 commits