boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-20 14:52:11 +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

35
test/stanford_graph_cc.cpp
View File

@@ -9,6 +9,7 @@
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_archetypes.hpp>
#include <boost/graph/stanford_graph.hpp>
#include <boost/concept/assert.hpp>
int main(int,char*[])
{
@@ -18,28 +19,28 @@ int main(int,char*[])
typedef Graph* Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< PropertyGraphConcept<Graph, Edge, edge_length_t > >();
function_requires<
PropertyGraphConcept<Graph, Vertex, u_property<Vertex> > >();
function_requires<
PropertyGraphConcept<Graph, Edge, a_property<Vertex> > >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( PropertyGraphConcept<Graph, Edge, edge_length_t > ));
BOOST_CONCEPT_ASSERT((
PropertyGraphConcept<Graph, Vertex, u_property<Vertex> > ));
BOOST_CONCEPT_ASSERT((
PropertyGraphConcept<Graph, Edge, a_property<Vertex> > ));
}
{
typedef const Graph* Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Edge, edge_length_t > >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, u_property<Vertex> > >();
function_requires<
ReadablePropertyGraphConcept<Graph, Edge, a_property<Vertex> > >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Edge, edge_length_t > ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, u_property<Vertex> > ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Edge, a_property<Vertex> > ));
}
return 0;
}