2
0
mirror of https://github.com/boostorg/graph.git synced 2026-01-27 19:02:12 +00:00
Files
graph/test/grid_graph_cc.cpp
Jeremiah Willcock 801a11bf4a Merged in changes from trunk for Boost.Graph and Boost.PropertyMap. Includes
r56013, r56014, r56015, r56016, r56017, r56089, r56097, r56116, r56117, r56126,
r56127, r56128, r56140, r56147, r56300, r56301, r56339, r56360, r56454, r56473,
r56563, r56651, r56654, r56658, r56682, r56732, r56796, r56855, r56856, r56868,
r55667, r56860, r55473, r55507, r55528, r55749, r56147, r55723, r56109, r56859,
and r55780.


[SVN r56881]
2009-10-15 20:40:46 +00:00

34 lines
1.2 KiB
C++

//=======================================================================
// Copyright 2009 Trustees of Indiana University.
// Authors: Michael Hansen, Andrew Lumsdaine
//
// 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_archetypes.hpp>
#include <boost/graph/graph_concepts.hpp>
#include <boost/graph/grid_graph.hpp>
#define DIMENSIONS 3
using namespace boost;
int main (int argc, char* argv[]) {
typedef grid_graph<DIMENSIONS> Graph;
typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::edge_descriptor Edge;
function_requires<BidirectionalGraphConcept<Graph> >();
function_requires<VertexListGraphConcept<Graph> >();
function_requires<EdgeListGraphConcept<Graph> >();
function_requires<IncidenceGraphConcept<Graph> >();
function_requires<AdjacencyGraphConcept<Graph> >();
function_requires<AdjacencyMatrixConcept<Graph> >();
function_requires<ReadablePropertyGraphConcept<Graph, Vertex, vertex_index_t> >();
function_requires<ReadablePropertyGraphConcept<Graph, Edge, edge_index_t> >();
return (0);
};