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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
|
// (C) Copyright 2009 Andrew Sutton
//
// Use, modification and distribution are subject to the
// Boost Software License, Version 1.0 (See accompanying file
// LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
/*
IMPORTANT!!!
~~~~~~~~~~~~
This example does not compile, see
https://github.com/boostorg/graph/issues/147
*/
#include <iostream>
#include <string>
#include <boost/graph/directed_graph.hpp>
#include <boost/graph/labeled_graph.hpp>
using namespace boost;
using namespace std;
int main()
{
using namespace boost::graph_detail;
typedef directed_graph<> Digraph;
{
typedef labeled_graph< Digraph, unsigned > Graph;
Graph g;
add_vertex(1, g);
add_vertex(2, g);
Graph h(12);
}
{
typedef labeled_graph< Digraph, string > Graph;
Graph g;
add_vertex("foo", g);
add_vertex("bar", g);
}
{
typedef labeled_graph< Digraph, string, mapS > Graph;
Graph g;
add_vertex("foo", g);
add_vertex("bar", g);
add_vertex("foo", g);
}
{
typedef labeled_graph< Digraph*, int > TempGraph;
Digraph g;
TempGraph h(&g);
add_vertex(12, h);
}
{
// This is actually a fairly complicated specialization.
typedef adjacency_list< vecS, vecS, bidirectionalS > G;
typedef labeled_graph< G, size_t > Graph;
Graph g;
add_vertex(0, g);
add_vertex(1, g);
g.add_edge(0, 1);
}
return 0;
}
|
