1//=======================================================================
2// Copyright 2002 Indiana University.
3// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
4//
5// Distributed under the Boost Software License, Version 1.0. (See
6// accompanying file LICENSE_1_0.txt or copy at
7// http://www.boost.org/LICENSE_1_0.txt)
8//=======================================================================
9
10//
11// The following test permutations are extracted from the old adj_list_test.cpp
12// which generated code on the fly, but was never run as part of the regular
13// tests.
14//
15#if TEST == 1
16#define TEST_TYPE vecS
17#define DIRECTED_TYPE bidirectionalS
18#elif TEST == 2
19#define TEST_TYPE vecS
20#define DIRECTED_TYPE directedS
21#elif TEST == 3
22#define TEST_TYPE vecS
23#define DIRECTED_TYPE undirectedS
24#elif TEST == 4
25#define TEST_TYPE listS
26#define DIRECTED_TYPE bidirectionalS
27#elif TEST == 5
28#define TEST_TYPE listS
29#define DIRECTED_TYPE directedS
30#elif TEST == 6
31#define TEST_TYPE listS
32#define DIRECTED_TYPE undirectedS
33#elif TEST == 7
34#define TEST_TYPE setS
35#define DIRECTED_TYPE bidirectionalS
36#elif TEST == 8
37#define TEST_TYPE setS
38#define DIRECTED_TYPE directedS
39#elif TEST == 9
40#define TEST_TYPE setS
41#define DIRECTED_TYPE undirectedS
42#else
43#error "No test combination specified - define macro TEST to the value 1 - 9."
44#endif
45
46#include <boost/graph/adjacency_list.hpp>
47typedef boost::adjacency_list< boost::TEST_TYPE, boost::TEST_TYPE,
48 boost::DIRECTED_TYPE, boost::property< vertex_id_t, std::size_t >,
49 boost::property< edge_id_t, std::size_t > >
50 Graph;
51typedef boost::property< vertex_id_t, std::size_t > VertexId;
52typedef boost::property< edge_id_t, std::size_t > EdgeID;
53

source code of boost/libs/graph/test/graph_type.hpp