boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-24 05:52:13 +00:00
Code Issues Projects Releases Wiki Activity

Merged r76050, r75547, r75891, r76049, r76083, and r76439 from trunk (reverse_graph bug fixes and fix for #6293); refs #6293

Browse Source 
[SVN r76535]
This commit is contained in:
Jeremiah Willcock
2012-01-15 23:32:09 +00:00
parent a88250f76f
commit 4b95dcfbe9
73 changed files with 756 additions and 564 deletions
Download Patch File Download Diff File Expand all files Collapse all files

20
example/implicit_graph.cpp
View File

@@ -4,7 +4,7 @@
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/concept/assert.hpp>
#include <boost/graph/adjacency_iterator.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>
#include <boost/graph/graph_concepts.hpp>
@@ -444,15 +444,15 @@ int main (int argc, char const *argv[]) {
// Check the concepts that graph models. This is included to demonstrate
// how concept checking works, but is not required for a working program
// since Boost algorithms do their own concept checking.
function_requires< BidirectionalGraphConcept<ring_graph> >();
function_requires< AdjacencyGraphConcept<ring_graph> >();
function_requires< VertexListGraphConcept<ring_graph> >();
function_requires< EdgeListGraphConcept<ring_graph> >();
function_requires< AdjacencyMatrixConcept<ring_graph> >();
function_requires<
ReadablePropertyMapConcept<const_edge_weight_map, edge_descriptor> >();
function_requires<
ReadablePropertyGraphConcept<ring_graph, edge_descriptor, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<ring_graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<ring_graph> ));
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<ring_graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<ring_graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyMatrixConcept<ring_graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyMapConcept<const_edge_weight_map, edge_descriptor> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<ring_graph, edge_descriptor, edge_weight_t> ));
// Specify the size of the graph on the command line, or use a default size
// of 5.