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
|
//=======================================================================
// Copyright 2018
// Authors: Rasmus Ahlberg
//
// 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 <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/graph_traits.hpp>
#include <boost/core/lightweight_test.hpp>
int main(int argc, char* argv[])
{
typedef int Vertex;
typedef int Edge;
typedef boost::adjacency_list< boost::setS, // Container type for edges
boost::vecS, // Container type for vertices
boost::directedS, // Param for
// directed/undirected/bidirectional
// graph
Vertex, // Type for the vertices
Edge // Type for the edges
>
Graph_t;
typedef Graph_t::edge_descriptor EdgeDesc;
typedef Graph_t::vertex_descriptor VertexType;
Graph_t m_graph;
VertexType v1 = boost::add_vertex(m_graph);
VertexType v2 = boost::add_vertex(m_graph);
VertexType v3 = boost::add_vertex(m_graph);
EdgeDesc ed1;
bool inserted1;
boost::tie(ed1, inserted1) = boost::add_edge(v3, v1, m_graph);
BOOST_TEST(inserted1);
static const int EDGE_VAL = 1234;
m_graph[ed1] = EDGE_VAL;
boost::remove_vertex(v2, m_graph);
std::cout << "ed1 " << m_graph[ed1] << std::endl;
BOOST_TEST(m_graph[ed1] == EDGE_VAL);
return boost::report_errors();
}
|
