boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-02-12 00:02:10 +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

297
test/adj_list_cc.cpp
View File

@@ -9,6 +9,7 @@
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_archetypes.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/concept/assert.hpp>
int main(int,char*[])
{
@@ -21,20 +22,20 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
{
typedef adjacency_list<vecS, vecS, bidirectionalS,
@@ -43,21 +44,21 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< BidirectionalGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
{
typedef adjacency_list< listS, listS, directedS,
@@ -66,20 +67,20 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
{
typedef adjacency_list< listS, listS, undirectedS,
@@ -88,20 +89,20 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
// Checking adjacency_list with EdgeList=setS
{
@@ -111,21 +112,21 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< BidirectionalGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
{
typedef adjacency_list< setS, listS, directedS,
@@ -134,20 +135,20 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
{
typedef adjacency_list< setS, listS, undirectedS,
@@ -156,105 +157,105 @@ int main(int,char*[])
> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> >();
function_requires<
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Vertex, vertex_color_t> ));
BOOST_CONCEPT_ASSERT((
LvaluePropertyGraphConcept<Graph, Edge, edge_weight_t> ));
}
// Check adjacency_list without any properties
{
typedef adjacency_list<vecS, vecS, directedS > Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< VertexMutablePropertyGraphConcept<Graph> >();
function_requires< EdgeMutablePropertyGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( VertexMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeMutablePropertyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
}
{
typedef adjacency_list<vecS, vecS, bidirectionalS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< BidirectionalGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires<
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT((
ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> ));
}
{
typedef adjacency_list< listS, listS, directedS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
}
{
typedef adjacency_list< listS, listS, undirectedS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
}
// Checking EdgeList=setS with no properties
{
typedef adjacency_list<setS, vecS, bidirectionalS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< BidirectionalGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
function_requires< ReadablePropertyGraphConcept<Graph,
Vertex, vertex_index_t> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( BidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<Graph,
Vertex, vertex_index_t> ));
}
{
typedef adjacency_list< setS, listS, directedS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< MutableIncidenceGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
BOOST_CONCEPT_ASSERT(( MutableIncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
}
{
typedef adjacency_list< setS, listS, undirectedS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires< VertexListGraphConcept<Graph> >();
function_requires< EdgeListGraphConcept<Graph> >();
function_requires< IncidenceGraphConcept<Graph> >();
function_requires< AdjacencyGraphConcept<Graph> >();
function_requires< MutableBidirectionalGraphConcept<Graph> >();
function_requires< MutableEdgeListGraphConcept<Graph> >();
BOOST_CONCEPT_ASSERT(( VertexListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( AdjacencyGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableBidirectionalGraphConcept<Graph> ));
BOOST_CONCEPT_ASSERT(( MutableEdgeListGraphConcept<Graph> ));
}
return 0;
}