1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
//=======================================================================
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//=======================================================================
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/graph_archetypes.hpp>
int main(int,char*[])
{
using namespace boost;
// Check graph concepts againt their archetypes
typedef default_constructible_archetype<
sgi_assignable_archetype< equality_comparable_archetype<> > > Vertex;
typedef incidence_graph_archetype<Vertex, directed_tag,
allow_parallel_edge_tag> Graph1;
function_requires< IncidenceGraphConcept<Graph1> >();
typedef adjacency_graph_archetype<Vertex, directed_tag,
allow_parallel_edge_tag> Graph2;
function_requires< AdjacencyGraphConcept<Graph2> >();
typedef vertex_list_graph_archetype<Vertex, directed_tag,
allow_parallel_edge_tag> Graph3;
function_requires< VertexListGraphConcept<Graph3> >();
function_requires< ColorValueConcept<color_value_archetype> >();
typedef incidence_graph_archetype<Vertex, directed_tag, allow_parallel_edge_tag> G;
typedef property_graph_archetype<G, vertex_color_t, color_value_archetype>
Graph4;
function_requires< PropertyGraphConcept<Graph4, Vertex, vertex_color_t> >();
return 0;
}
|
