mirror of
https://github.com/boostorg/graph.git
synced 2025-05-11 05:14:01 +00:00
195 lines
9.3 KiB
C++
195 lines
9.3 KiB
C++
/* adjacency_matrix_test.cpp source file
|
|
*
|
|
* Copyright Cromwell D. Enage 2004
|
|
*
|
|
* Permission to use, copy, modify, sell, and distribute this software
|
|
* is hereby granted without fee provided that the above copyright notice
|
|
* appears in all copies and that both that copyright notice and this
|
|
* permission notice appear in supporting documentation,
|
|
*
|
|
* Cromwell D. Enage makes no representations about the suitability of this
|
|
* software for any purpose. It is provided "as is" without express or
|
|
* implied warranty.
|
|
*/
|
|
|
|
/*
|
|
* Defines the std::ios class and std::cout, its global output instance.
|
|
*/
|
|
#include <iostream>
|
|
|
|
/*
|
|
* Defines the boost::property_map class template and the boost::get and
|
|
* boost::put function templates.
|
|
*/
|
|
#include <boost/property_map.hpp>
|
|
|
|
/*
|
|
* Defines the boost::graph_traits class template.
|
|
*/
|
|
#include <boost/graph/graph_traits.hpp>
|
|
|
|
/*
|
|
* Defines the vertex and edge property tags.
|
|
*/
|
|
#include <boost/graph/properties.hpp>
|
|
|
|
/*
|
|
* Defines the boost::adjacency_list class template and its associated
|
|
* non-member function templates.
|
|
*/
|
|
#include <boost/graph/adjacency_list.hpp>
|
|
|
|
/*
|
|
* Defines the boost::adjacency_matrix class template and its associated
|
|
* non-member function templates.
|
|
*/
|
|
#include <boost/graph/adjacency_matrix.hpp>
|
|
|
|
#include <boost/test/minimal.hpp>
|
|
|
|
int test_main(int, char*[])
|
|
{
|
|
// Use setS to keep out edges in order, so they match the adjacency_matrix.
|
|
typedef boost::adjacency_list<boost::setS, boost::vecS, boost::undirectedS>
|
|
Graph1;
|
|
typedef boost::adjacency_matrix<boost::undirectedS>
|
|
Graph2;
|
|
typedef boost::property_map<Graph1, boost::vertex_index_t>::type
|
|
IndexMap1;
|
|
typedef boost::property_map<Graph2, boost::vertex_index_t>::type
|
|
IndexMap2;
|
|
|
|
Graph1 g1(24);
|
|
Graph2 g2(24);
|
|
|
|
boost::add_edge(boost::vertex(0, g1), boost::vertex(7, g1), g1);
|
|
boost::add_edge(boost::vertex(0, g2), boost::vertex(7, g2), g2);
|
|
boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1);
|
|
boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2);
|
|
boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1);
|
|
boost::add_edge(boost::vertex(2, g2), boost::vertex(10, g2), g2);
|
|
boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1);
|
|
boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2);
|
|
boost::add_edge(boost::vertex(3, g1), boost::vertex(10, g1), g1);
|
|
boost::add_edge(boost::vertex(3, g2), boost::vertex(10, g2), g2);
|
|
boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1);
|
|
boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2);
|
|
boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1);
|
|
boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2);
|
|
boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1);
|
|
boost::add_edge(boost::vertex(4, g2), boost::vertex(0, g2), g2);
|
|
boost::add_edge(boost::vertex(5, g1), boost::vertex(14, g1), g1);
|
|
boost::add_edge(boost::vertex(5, g2), boost::vertex(14, g2), g2);
|
|
boost::add_edge(boost::vertex(6, g1), boost::vertex(3, g1), g1);
|
|
boost::add_edge(boost::vertex(6, g2), boost::vertex(3, g2), g2);
|
|
boost::add_edge(boost::vertex(7, g1), boost::vertex(17, g1), g1);
|
|
boost::add_edge(boost::vertex(7, g2), boost::vertex(17, g2), g2);
|
|
boost::add_edge(boost::vertex(7, g1), boost::vertex(11, g1), g1);
|
|
boost::add_edge(boost::vertex(7, g2), boost::vertex(11, g2), g2);
|
|
boost::add_edge(boost::vertex(8, g1), boost::vertex(17, g1), g1);
|
|
boost::add_edge(boost::vertex(8, g2), boost::vertex(17, g2), g2);
|
|
boost::add_edge(boost::vertex(8, g1), boost::vertex(1, g1), g1);
|
|
boost::add_edge(boost::vertex(8, g2), boost::vertex(1, g2), g2);
|
|
boost::add_edge(boost::vertex(9, g1), boost::vertex(11, g1), g1);
|
|
boost::add_edge(boost::vertex(9, g2), boost::vertex(11, g2), g2);
|
|
boost::add_edge(boost::vertex(9, g1), boost::vertex(1, g1), g1);
|
|
boost::add_edge(boost::vertex(9, g2), boost::vertex(1, g2), g2);
|
|
boost::add_edge(boost::vertex(10, g1), boost::vertex(19, g1), g1);
|
|
boost::add_edge(boost::vertex(10, g2), boost::vertex(19, g2), g2);
|
|
boost::add_edge(boost::vertex(10, g1), boost::vertex(15, g1), g1);
|
|
boost::add_edge(boost::vertex(10, g2), boost::vertex(15, g2), g2);
|
|
boost::add_edge(boost::vertex(10, g1), boost::vertex(8, g1), g1);
|
|
boost::add_edge(boost::vertex(10, g2), boost::vertex(8, g2), g2);
|
|
boost::add_edge(boost::vertex(11, g1), boost::vertex(19, g1), g1);
|
|
boost::add_edge(boost::vertex(11, g2), boost::vertex(19, g2), g2);
|
|
boost::add_edge(boost::vertex(11, g1), boost::vertex(15, g1), g1);
|
|
boost::add_edge(boost::vertex(11, g2), boost::vertex(15, g2), g2);
|
|
boost::add_edge(boost::vertex(11, g1), boost::vertex(4, g1), g1);
|
|
boost::add_edge(boost::vertex(11, g2), boost::vertex(4, g2), g2);
|
|
boost::add_edge(boost::vertex(12, g1), boost::vertex(19, g1), g1);
|
|
boost::add_edge(boost::vertex(12, g2), boost::vertex(19, g2), g2);
|
|
boost::add_edge(boost::vertex(12, g1), boost::vertex(8, g1), g1);
|
|
boost::add_edge(boost::vertex(12, g2), boost::vertex(8, g2), g2);
|
|
boost::add_edge(boost::vertex(12, g1), boost::vertex(4, g1), g1);
|
|
boost::add_edge(boost::vertex(12, g2), boost::vertex(4, g2), g2);
|
|
boost::add_edge(boost::vertex(13, g1), boost::vertex(15, g1), g1);
|
|
boost::add_edge(boost::vertex(13, g2), boost::vertex(15, g2), g2);
|
|
boost::add_edge(boost::vertex(13, g1), boost::vertex(8, g1), g1);
|
|
boost::add_edge(boost::vertex(13, g2), boost::vertex(8, g2), g2);
|
|
boost::add_edge(boost::vertex(13, g1), boost::vertex(4, g1), g1);
|
|
boost::add_edge(boost::vertex(13, g2), boost::vertex(4, g2), g2);
|
|
boost::add_edge(boost::vertex(14, g1), boost::vertex(22, g1), g1);
|
|
boost::add_edge(boost::vertex(14, g2), boost::vertex(22, g2), g2);
|
|
boost::add_edge(boost::vertex(14, g1), boost::vertex(12, g1), g1);
|
|
boost::add_edge(boost::vertex(14, g2), boost::vertex(12, g2), g2);
|
|
boost::add_edge(boost::vertex(15, g1), boost::vertex(22, g1), g1);
|
|
boost::add_edge(boost::vertex(15, g2), boost::vertex(22, g2), g2);
|
|
boost::add_edge(boost::vertex(15, g1), boost::vertex(6, g1), g1);
|
|
boost::add_edge(boost::vertex(15, g2), boost::vertex(6, g2), g2);
|
|
boost::add_edge(boost::vertex(16, g1), boost::vertex(12, g1), g1);
|
|
boost::add_edge(boost::vertex(16, g2), boost::vertex(12, g2), g2);
|
|
boost::add_edge(boost::vertex(16, g1), boost::vertex(6, g1), g1);
|
|
boost::add_edge(boost::vertex(16, g2), boost::vertex(6, g2), g2);
|
|
boost::add_edge(boost::vertex(17, g1), boost::vertex(20, g1), g1);
|
|
boost::add_edge(boost::vertex(17, g2), boost::vertex(20, g2), g2);
|
|
boost::add_edge(boost::vertex(18, g1), boost::vertex(9, g1), g1);
|
|
boost::add_edge(boost::vertex(18, g2), boost::vertex(9, g2), g2);
|
|
boost::add_edge(boost::vertex(19, g1), boost::vertex(23, g1), g1);
|
|
boost::add_edge(boost::vertex(19, g2), boost::vertex(23, g2), g2);
|
|
boost::add_edge(boost::vertex(19, g1), boost::vertex(18, g1), g1);
|
|
boost::add_edge(boost::vertex(19, g2), boost::vertex(18, g2), g2);
|
|
boost::add_edge(boost::vertex(20, g1), boost::vertex(23, g1), g1);
|
|
boost::add_edge(boost::vertex(20, g2), boost::vertex(23, g2), g2);
|
|
boost::add_edge(boost::vertex(20, g1), boost::vertex(13, g1), g1);
|
|
boost::add_edge(boost::vertex(20, g2), boost::vertex(13, g2), g2);
|
|
boost::add_edge(boost::vertex(21, g1), boost::vertex(18, g1), g1);
|
|
boost::add_edge(boost::vertex(21, g2), boost::vertex(18, g2), g2);
|
|
boost::add_edge(boost::vertex(21, g1), boost::vertex(13, g1), g1);
|
|
boost::add_edge(boost::vertex(21, g2), boost::vertex(13, g2), g2);
|
|
boost::add_edge(boost::vertex(22, g1), boost::vertex(21, g1), g1);
|
|
boost::add_edge(boost::vertex(22, g2), boost::vertex(21, g2), g2);
|
|
boost::add_edge(boost::vertex(23, g1), boost::vertex(16, g1), g1);
|
|
boost::add_edge(boost::vertex(23, g2), boost::vertex(16, g2), g2);
|
|
|
|
IndexMap1 index_map1 = boost::get(boost::vertex_index_t(), g1);
|
|
IndexMap2 index_map2 = boost::get(boost::vertex_index_t(), g2);
|
|
boost::graph_traits<Graph1>::vertex_iterator vi1, vend1;
|
|
boost::graph_traits<Graph2>::vertex_iterator vi2, vend2;
|
|
|
|
boost::graph_traits<Graph1>::adjacency_iterator ai1, aend1;
|
|
boost::graph_traits<Graph2>::adjacency_iterator ai2, aend2;
|
|
|
|
for (boost::tie(vi1, vend1) = boost::vertices(g1), boost::tie(vi2, vend2) =boost::vertices(g2); vi1 != vend1; ++vi1, ++vi2)
|
|
{
|
|
BOOST_TEST(boost::get(index_map1, *vi1) == boost::get(index_map2, *vi2));
|
|
|
|
for (boost::tie(ai1, aend1) = boost::adjacent_vertices(*vi1, g1),
|
|
boost::tie(ai2, aend2) = boost::adjacent_vertices(*vi2, g2);
|
|
ai1 != aend1;
|
|
++ai1, ++ai2)
|
|
{
|
|
BOOST_TEST(boost::get(index_map1, *ai1) == boost::get(index_map2, *ai2));
|
|
}
|
|
}
|
|
|
|
boost::graph_traits<Graph1>::out_edge_iterator ei1, eend1;
|
|
boost::graph_traits<Graph2>::out_edge_iterator ei2, eend2;
|
|
|
|
for (boost::tie(vi1, vend1) = boost::vertices(g1),
|
|
boost::tie(vi2, vend2) = boost::vertices(g2); vi1 != vend1; ++vi1, ++vi2)
|
|
{
|
|
BOOST_TEST(boost::get(index_map1, *vi1) == boost::get(index_map2, *vi2));
|
|
|
|
for (boost::tie(ei1, eend1) = boost::out_edges(*vi1, g1),
|
|
boost::tie(ei2, eend2) = boost::out_edges(*vi2, g2);
|
|
ei1 != eend1;
|
|
++ei1, ++ei2)
|
|
{
|
|
BOOST_TEST(boost::get(index_map1, boost::target(*ei1, g1)) == boost::get(index_map2, boost::target(*ei2, g2)));
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|