| 1 | //======================================================================= |
|---|
| 2 | // Copyright 1997, 1998, 1999, 2000 University of Notre Dame. |
|---|
| 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 | #include <boost/graph/graph_concepts.hpp> |
|---|
| 10 | #include <boost/graph/graph_archetypes.hpp> |
|---|
| 11 | #include <boost/graph/edge_list.hpp> |
|---|
| 12 | #include <boost/concept/assert.hpp> |
|---|
| 13 | #include <cstddef> |
|---|
| 14 | #include <iterator> |
|---|
| 15 | |
|---|
| 16 | int main(int, char*[]) |
|---|
| 17 | { |
|---|
| 18 | // Check edge_list |
|---|
| 19 | { |
|---|
| 20 | using namespace boost; |
|---|
| 21 | |
|---|
| 22 | typedef std::pair< int, int > E; |
|---|
| 23 | |
|---|
| 24 | typedef edge_list< E*, E, std::ptrdiff_t, |
|---|
| 25 | std::random_access_iterator_tag > |
|---|
| 26 | EdgeList; |
|---|
| 27 | |
|---|
| 28 | typedef graph_traits< EdgeList >::edge_descriptor Edge; |
|---|
| 29 | |
|---|
| 30 | BOOST_CONCEPT_ASSERT((EdgeListGraphConcept< EdgeList >)); |
|---|
| 31 | |
|---|
| 32 | BOOST_CONCEPT_ASSERT( |
|---|
| 33 | (ReadablePropertyGraphConcept< EdgeList, Edge, edge_index_t >)); |
|---|
| 34 | } |
|---|
| 35 | return 0; |
|---|
| 36 | } |
|---|
| 37 | |
|---|
