mirror of
https://github.com/boostorg/graph.git
synced 2026-01-30 20:02:12 +00:00
51d60f9b43
libs/graph/test/isomorphism.cpp: Deal with atoi/atof missing from std:: boost/graph//adjacency_matrix.hpp: deal with missing allocator<T>::rebind boost/graph/graph_test.hpp: Remove unusable default constructor (workaround) boost/graph/vector_as_graph.hpp: When we say remove, we mean std::remove status/explicit-failures-markup.xml: mark everything I can't or won't fix [SVN r23237]
50 lines
1.9 KiB
C++
50 lines
1.9 KiB
C++
//=======================================================================
|
|
// Copyright 1997, 1998, 1999, 2000 University of Notre Dame.
|
|
// Authors: Andrew Lumsdaine, Lie-Quan Lee, Jeremy G. Siek
|
|
//
|
|
// This file is part of the Boost Graph Library
|
|
//
|
|
// You should have received a copy of the License Agreement for the
|
|
// Boost Graph Library along with the software; see the file LICENSE.
|
|
// If not, contact Office of Research, University of Notre Dame, Notre
|
|
// Dame, IN 46556.
|
|
//
|
|
// Permission to modify the code and to distribute modified code is
|
|
// granted, provided the text of this NOTICE is retained, a notice that
|
|
// the code was modified is included with the above COPYRIGHT NOTICE and
|
|
// with the COPYRIGHT NOTICE in the LICENSE file, and that the LICENSE
|
|
// file is distributed with the modified code.
|
|
//
|
|
// LICENSOR MAKES NO REPRESENTATIONS OR WARRANTIES, EXPRESS OR IMPLIED.
|
|
// By way of example, but not limitation, Licensor MAKES NO
|
|
// REPRESENTATIONS OR WARRANTIES OF MERCHANTABILITY OR FITNESS FOR ANY
|
|
// PARTICULAR PURPOSE OR THAT THE USE OF THE LICENSED SOFTWARE COMPONENTS
|
|
// OR DOCUMENTATION WILL NOT INFRINGE ANY PATENTS, COPYRIGHTS, TRADEMARKS
|
|
// OR OTHER RIGHTS.
|
|
//=======================================================================
|
|
#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;
|
|
}
|