boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-31 20:22:09 +00:00
Code Issues Projects Releases Wiki Activity
2,430 Commits 115 Branches 134 Tags
63bca89427b2bf64167d9011eeae352b2c579656
Commit Graph

4 Commits

Author SHA1 Message Date
Jeremiah Willcock
42cf78c555 Changed to boost::unordered_* containers instead of compiler-specific ones; made hashed containers enabled always 
[SVN r57560]
 2009-11-11 02:59:25 +00:00
Andrew Sutton
704e2a0894 Added missing copyright info for test files. 
[SVN r52403]
 2009-04-15 12:24:21 +00:00
Andrew Sutton
372c7e5740 Removing missing include header 
[SVN r50314]
 2008-12-18 13:35:31 +00:00
Andrew Sutton
9ad0c6a23c Fixed #1622. A viable solution relies on the fact that incident edges in a 
loop are stored adjacently in the out edge list of the vertex. A simple
modification of the global edge erasing loop for undirected graphs will
skip the next iterator if both the current and next contain the same iterator.


[SVN r50206]
 2008-12-08 19:03:20 +00:00