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
|
//=======================================================================
// 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>
#include <boost/graph/edge_list.hpp>
#include <cstddef>
#include <iterator>
int main(int,char*[])
{
// Check edge_list
{
using namespace boost;
typedef std::pair<int,int> E;
typedef edge_list<E*,E,std::ptrdiff_t,std::random_access_iterator_tag> EdgeList;
typedef graph_traits<EdgeList>::edge_descriptor Edge;
function_requires< EdgeListGraphConcept<EdgeList> >();
function_requires< ReadablePropertyGraphConcept<EdgeList, Edge,
edge_index_t> >();
}
return 0;
}
|
