edge_list_cc.cpp 1.1 KB

12345678910111213141516171819202122232425262728293031323334
  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. int main(int,char*[])
  16. {
  17. // Check edge_list
  18. {
  19. using namespace boost;
  20. typedef std::pair<int,int> E;
  21. typedef edge_list<E*,E,std::ptrdiff_t,std::random_access_iterator_tag> EdgeList;
  22. typedef graph_traits<EdgeList>::edge_descriptor Edge;
  23. BOOST_CONCEPT_ASSERT(( EdgeListGraphConcept<EdgeList> ));
  24. BOOST_CONCEPT_ASSERT(( ReadablePropertyGraphConcept<EdgeList, Edge,
  25. edge_index_t> ));
  26. }
  27. return 0;
  28. }