123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129 |
- // (C) Copyright 2009 Andrew Sutton
- //
- // Use, modification and distribution are subject to the
- // Boost Software License, Version 1.0 (See accompanying file
- // LICENSE_1_0.txt or http://www.boost.org/LICENSE_1_0.txt)
- #ifndef TEST_CONSTRUCTION_HPP
- #define TEST_CONSTRUCTION_HPP
- #include <boost/concept/assert.hpp>
- #include <utility>
- /** @name Build Graph
- * Build the standard graph structure used in the remaining tests. Depending
- * on the mutability traits of the graph G, this may or may not add N vertices
- * to graph. The Add and Label type parameters are used to dispatch a build
- * method for normal or labeled graphs.
- */
- //@{
- // This will basically catch adjacency matrices, which don't get built.
- template <typename Graph, typename Add, typename Label>
- void build_graph(Graph& g, Add, Label)
- { }
- // This matches MutableGraph, so just add some vertices.
- template <typename Graph>
- void build_graph(Graph& g, boost::mpl::true_, boost::mpl::false_) {
- using namespace boost;
- BOOST_CONCEPT_ASSERT((VertexListGraphConcept<Graph>));
- BOOST_CONCEPT_ASSERT((VertexMutableGraphConcept<Graph>));
- std::cout << "...build_normal\n";
- for(std::size_t i = 0; i < N; ++i) {
- add_vertex(g);
- }
- BOOST_ASSERT(num_vertices(g) == N);
- }
- // This will match labeled graphs.
- template <typename Graph>
- void build_graph(Graph& g, boost::mpl::false_, boost::mpl::true_) {
- using namespace boost;
- BOOST_CONCEPT_ASSERT((VertexListGraphConcept<Graph>));
- // BOOST_CONCEPT_ASSERT((VertexMutableGraphConcept<Graph>));
- std::cout << "...build_labeled\n";
- // Add each vertex labeled with the number i.
- for(std::size_t i = 0; i < N; ++i) {
- add_vertex(i, g);
- }
- BOOST_ASSERT(num_vertices(g) == N);
- }
- //@}
- /** @name Build Mutable
- * For mutable property graphs, try to add a vertex with a property. This test
- * actually builds a new graph - or at least tries to. We're not testing for
- * labeled graphs since that's actually done in build_graph above.
- */
- //@{
- template <typename Graph, typename Add, typename Label>
- void build_property_graph(Graph const& g, Add, Label)
- { }
- template <typename Graph>
- void build_property_graph(Graph const&, boost::mpl::true_, boost::mpl::false_) {
- using namespace boost;
- BOOST_CONCEPT_ASSERT((VertexMutablePropertyGraphConcept<Graph>));
- typedef typename vertex_property_type<Graph>::type VertexProp;
- std::cout << "...build mutable\n";
- // Start with clean graph. Nothing really to assert. Just make sure it
- // copmpiles.
- Graph h;
- add_vertex(VertexProp(), h);
- }
- //@}
- /** @name Connect Graph
- * Given a constructed graph, connect the edges to create a the standard
- * testing graph. To facilitate ease of use, we pass a vector of vertices
- * along with the graph such that v[0] -> *vertices(g).first, etc. The
- * Labeled type parameter is used to dispatch connection techniques for
- * normal or labled graphs.
- */
- //@{
- template <typename Graph, typename VertexSet>
- void connect_graph(Graph& g, VertexSet const& verts, boost::mpl::false_) {
- using namespace boost;
- BOOST_CONCEPT_ASSERT((AdjacencyMatrixConcept<Graph>));
- BOOST_CONCEPT_ASSERT((EdgeMutableGraphConcept<Graph>));
- std::cout << "...connect_normal\n";
- Pair *f, *l;
- for(boost::tie(f, l) = edge_pairs(); f != l; ++f) {
- Pair const& e = *f;
- add_edge(verts[e.first], verts[e.second], g);
- }
- // Is the lollipop connected? Is the lollipop not connected to the roof?
- BOOST_ASSERT(edge(verts[5], verts[3], g).second == true);
- BOOST_ASSERT(edge(verts[5], verts[0], g).second == false);
- }
- template <typename Graph, typename VertexSet>
- void connect_graph(Graph& g, VertexSet const& verts, boost::mpl::true_) {
- using namespace boost;
- BOOST_CONCEPT_ASSERT((AdjacencyMatrixConcept<Graph>));
- // BOOST_CONCEPT_ASSERT((EdgeMutableGraphConcept<Graph>));
- std::cout << "...connect_labeled\n";
- // With labeled graphs, we want to operate directly on the edge numbers
- // rather than looking up the correct vertex index. This is because the
- // vertices are already mapped to indices.
- Pair* p = edge_pairs().first;
- for(std::size_t i = 0; i < M; ++i) {
- Pair const& e = p[i];
- add_edge_by_label(e.first, e.second, g);
- }
- // Is the lollipop connected?
- BOOST_ASSERT(edge_by_label(5, 3, g).second == true);
- BOOST_ASSERT(edge_by_label(5, 0, g).second == false);
- }
- //@}
- #endif
|