1. 02 Jan, 2014 1 commit
  2. 21 Dec, 2013 1 commit
  3. 10 Nov, 2013 1 commit
  4. 25 Apr, 2013 1 commit
  5. 11 Feb, 2013 1 commit
  6. 10 Jan, 2013 1 commit
  7. 06 Jan, 2013 1 commit
  8. 26 Dec, 2012 1 commit
  9. 02 Aug, 2012 1 commit
  10. 03 Jun, 2012 1 commit
  11. 02 May, 2012 1 commit
  12. 29 Apr, 2012 3 commits
  13. 14 Sep, 2011 1 commit
  14. 02 Sep, 2011 1 commit
  15. 26 Aug, 2011 1 commit
  16. 24 Aug, 2011 1 commit
    • Tiago Peixoto's avatar
      Several improvements to random_rewire() / random_graph() · 8240714e
      Tiago Peixoto authored
      This introduces several simplifications and corrections to the graph
      rewire algorithm, to guarantee unbiased sampling.
      
      Now a move is outright rejected if it produces a
      self-loop/parallel-edge, instead of retried. This also adds a
      "non-sweep" mode, where edges are rewired randomly, possibly with
      repetition.
      
      The edge moves are now simplified to the target of the edges only,
      since swaping sources is redundant.
      
      The number of iterations can now be explicitly modified, so it is not
      necessary to call the function more than once, and it is emphasized in
      the documentation that only after sufficiently many iterations can the
      graph be guaranteed to be fully mixed.
      8240714e
  17. 10 Feb, 2011 1 commit
  18. 13 Nov, 2010 1 commit
  19. 25 Jul, 2010 1 commit
  20. 07 Mar, 2010 1 commit
  21. 20 Feb, 2010 2 commits
    • Tiago Peixoto's avatar
      Include probabilistic random_rewire() strategy · 64cb52b3
      Tiago Peixoto authored
      This includes also some internal refactoring, and bug fixes.
      64cb52b3
    • 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
      desired).
      
      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.
      b678e65a
  22. 14 Feb, 2010 1 commit
  23. 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.
      d158af8f
  24. 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.
      154ef865
  25. 22 Dec, 2009 1 commit
  26. 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.
      6d1810e1
  27. 06 Sep, 2009 1 commit
  28. 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.
      f257d426
  29. 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
      necessary.
      c72e48d5
  30. 04 Aug, 2009 1 commit
  31. 02 Jun, 2009 2 commits
  32. 23 May, 2009 1 commit
  33. 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.
      6defdb43
    • 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)
      684efca7
  34. 10 Feb, 2009 1 commit
    • Tiago Peixoto's avatar
      Fix spurious parallel edge creation in random_rewire() · 50eec674
      Tiago Peixoto authored
      In some circumstances, the test for parallel edges would fail to detect
      one, if it involved another "new" edge and one of the current ones being
      rewired.
      
      This commit also removes the requirement that edge indexes be continuous
      in the range [0, num_edges(g)), which is not in general the case.
      50eec674
  35. 06 Feb, 2009 1 commit
    • Tiago Peixoto's avatar
      Disable internal bounds checking in property maps · 0ababf9c
      Tiago Peixoto authored
      This includes a new vector property map type (fast_vector_property_map)
      which has optional disabling of bounds checking, through its associate
      map type (unchecked_fast_vector_property_map). This should improve
      performance on algorithms which depend on tight loops which access
      property maps.
      
      Bounds checking is only disabled locally just before the algorithms run,
      and proper care is taken for bounds checking _beforehand_. The property
      maps exposed to python still have internal bounds checking.
      0ababf9c