1. 06 May, 2011 1 commit
    • Tiago Peixoto's avatar
      Improve price_network() seeding semantics · c11b6af7
      Tiago Peixoto authored
      Now, if 'm' is larger than the seed graph, it is set to the size of the
      seed graph, and is increased progressively until it matches the desired
      value. This removes the need to start with a random seed graph of the
      appropriate size.
      This also includes modifications which make the code more robust
      against parameter choices which don't make much sense, e.g. lead to
      negative probabilites.
  2. 10 Feb, 2011 1 commit
  3. 10 Dec, 2010 1 commit
  4. 04 Dec, 2010 1 commit
  5. 24 Nov, 2010 2 commits
  6. 13 Nov, 2010 4 commits
  7. 10 Oct, 2010 1 commit
  8. 04 Oct, 2010 1 commit
  9. 25 Jul, 2010 1 commit
  10. 03 May, 2010 2 commits
  11. 07 Mar, 2010 1 commit
  12. 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.
    • Tiago Peixoto's avatar
      Include probabilistic random_rewire() strategy · 64cb52b3
      Tiago Peixoto authored
      This includes also some internal refactoring, and bug fixes.
    • 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
      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.
  13. 14 Feb, 2010 1 commit
  14. 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.
  15. 10 Jan, 2010 1 commit
  16. 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.
  17. 22 Dec, 2009 1 commit
  18. 14 Dec, 2009 1 commit
  19. 06 Dec, 2009 2 commits
  20. 05 Nov, 2009 1 commit
    • Tiago Peixoto's avatar
      Sync with boost 1.40 · 6d1810e1
      Tiago Peixoto authored
      Fix compilation warnings with boost 1.40, remove unnecessary files, fix
      autoconf macros and link with "boost_graph".
      This also raises the minimum boost version to 1.40.
  21. 23 Oct, 2009 1 commit
  22. 06 Sep, 2009 3 commits
  23. 27 Aug, 2009 1 commit
  24. 21 Aug, 2009 1 commit
    • Tiago Peixoto's avatar
      Dump lambda::bind in favor of boost::bind · 7fb5d71d
      Tiago Peixoto authored
      This is a large commit which replaces lambda::bind with boost::bind in
      most parts of the code. This improves compilation time, and slightly
      decreases compilation memory usage in some cases.
  25. 17 Aug, 2009 1 commit
  26. 13 Aug, 2009 1 commit
    • Tiago Peixoto's avatar
      Reorganize exceptions thrown · f257d426
      Tiago Peixoto authored
      No longer only thrown GraphError upon any error, but instead throw
      specific exceptions which are more meaninful and are mapped to standard
      python exceptions, such as IOError, ValueError and RuntimeError.
  27. 07 Aug, 2009 1 commit
    • Tiago Peixoto's avatar
      Fix bug in random_rewire() with undirected graphs · c72e48d5
      Tiago Peixoto authored
      When using undirected graphs, the implicit direction of each edge was
      not properly handled, and the correlated case would not work. Now, in
      this case, the direction is always checked, and the edge is inverted if
  28. 04 Aug, 2009 2 commits
  29. 15 Jul, 2009 1 commit
    • 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.