1. 08 Jul, 2020 1 commit
  2. 08 Jun, 2020 1 commit
  3. 22 Mar, 2020 1 commit
  4. 05 Jun, 2019 1 commit
  5. 07 Apr, 2019 1 commit
  6. 14 Feb, 2018 1 commit
  7. 19 Nov, 2017 1 commit
  8. 02 Sep, 2017 1 commit
  9. 05 Feb, 2017 1 commit
    • Tiago Peixoto's avatar
      Improve underlying adjacency list implementation · 80692ffd
      Tiago Peixoto authored
      This changes the underlying adjacency matrix implementation to a single
      mixed in + out edge list for each node, instead of separate ones. This
      simplifies the undirected_adaptor<> so that its out-edge iterators
      become trivial, and also faster.
      80692ffd
  10. 01 Jan, 2017 1 commit
  11. 01 Nov, 2016 1 commit
  12. 19 Oct, 2016 1 commit
  13. 22 Apr, 2016 1 commit
  14. 02 Apr, 2016 1 commit
  15. 18 Jan, 2016 1 commit
  16. 01 Jan, 2016 1 commit
  17. 22 Nov, 2015 1 commit
  18. 15 Jul, 2015 1 commit
    • Tiago Peixoto's avatar
      Remove dense_hash_map/set cruft · a6667db7
      Tiago Peixoto authored
      This implements a general wrapper for dense_hash_map and dense_hash_set,
      that falls back to unordered_map and unordered_set, if sparsehash is not
      enabled.
      a6667db7
  19. 29 Jan, 2015 1 commit
  20. 08 Jan, 2015 1 commit
  21. 09 Jun, 2014 1 commit
  22. 03 Jan, 2014 1 commit
  23. 02 Jan, 2014 1 commit
  24. 21 Dec, 2013 1 commit
  25. 10 Nov, 2013 1 commit
  26. 02 Nov, 2013 1 commit
  27. 22 Jul, 2013 1 commit
  28. 15 Jul, 2013 1 commit
  29. 10 Jan, 2013 1 commit
  30. 06 Jan, 2013 1 commit
  31. 03 Jun, 2012 1 commit
  32. 02 May, 2012 1 commit
  33. 15 Apr, 2011 1 commit
  34. 11 Apr, 2011 1 commit
  35. 10 Feb, 2011 1 commit
  36. 13 Nov, 2010 1 commit
  37. 25 Jul, 2010 1 commit
  38. 07 Mar, 2010 1 commit
  39. 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)
      684efca7
  40. 22 Jul, 2008 1 commit