9 Commits

Author SHA1 Message Date
Peter Kerzum
b0be1f7087 Make adjacency_matrix implement BidirectionalGraph concept
Adjacency matrix is by nature bidirectional and one can see that the
concept was mostly implemented before. That implementation missed
the degree function(s). These functions are implemented in this commit
and the traversal_category is updated to meet the concept requirements.

Tests are also added, though they are a bit shallow in the sense that
they seem to omit intensive algorithms.
2024-12-12 03:33:26 +01:00
Josh Marshall
8747675e12 Applied clang-format and stripped all trailing whitespace. 2019-05-02 16:31:08 -04:00
Matt Barr
387bcb3d72 Add degree to reverse_graph (#78)
degree is required for BidirectionalGraphConcept.
Also adds the concept check to the reverse_graph unit test.
2016-10-31 14:03:54 -06:00
Jeremiah Willcock
cd1fee5f7d Applied fixed version of patch from #6293; fixes #6293
[SVN r76050]
2011-12-18 21:09:34 +00:00
Jeremiah Willcock
231bb5dbfb Added documented way to get underlying edge descriptor from a reverse_graph; changed name of member to prevent future use
[SVN r76049]
2011-12-18 20:53:26 +00:00
Douglas Gregor
52507c33cf Don't dereference NULL pointers, even though the code will never run
[SVN r28654]
2005-05-04 14:42:38 +00:00
Douglas Gregor
87588dd9ff Support set_property and get_property
[SVN r28579]
2005-05-02 15:33:35 +00:00
Douglas Gregor
2577136447 Converted to Boost Software License
[SVN r27800]
2005-03-24 14:54:12 +00:00
Jeremy Siek
296884f7d9 moved concept checking stuff from example/ to test/ directory
renamed dynamic components to incremental components
added regression.cfg file to test/


[SVN r9337]
2001-02-26 18:12:20 +00:00