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
|
// Copyright 2004 The Trustees of Indiana University.
// Use, modification and distribution is subject to 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)
// Authors: Douglas Gregor
// Andrew Lumsdaine
#include <boost/graph/sequential_vertex_coloring.hpp>
#include <boost/core/lightweight_test.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <utility>
using namespace boost;
int main(int, char*[])
{
typedef adjacency_list< listS, vecS, undirectedS > Graph;
typedef graph_traits< Graph >::vertices_size_type vertices_size_type;
typedef property_map< Graph, vertex_index_t >::const_type vertex_index_map;
typedef std::pair< int, int > Edge;
enum nodes
{
A,
B,
C,
D,
E,
n
};
Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E),
Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B) };
int m = sizeof(edge_array) / sizeof(Edge);
Graph g(edge_array, edge_array + m, n);
// Test with the normal order
std::vector< vertices_size_type > color_vec(num_vertices(g));
iterator_property_map< vertices_size_type*, vertex_index_map,
vertices_size_type, vertices_size_type& >
color(&color_vec.front(), get(vertex_index, g));
vertices_size_type num_colors = sequential_vertex_coloring(g, color);
BOOST_TEST(num_colors == 3);
BOOST_TEST(get(color, (vertices_size_type)A) == 0);
BOOST_TEST(get(color, (vertices_size_type)B) == 0);
BOOST_TEST(get(color, (vertices_size_type)C) == 1);
BOOST_TEST(get(color, (vertices_size_type)D) == 2);
BOOST_TEST(get(color, (vertices_size_type)E) == 1);
return boost::report_errors();
}
|
