*
*/
-#define BOOST_TEST_MODULE subgraph_add
-
// std lib includes
#include <iostream>
// include boost components
-#include <boost/test/unit_test.hpp>
+#include <boost/core/lightweight_test.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/iteration_macros.hpp>
using namespace boost;
-BOOST_AUTO_TEST_CASE(simpleGraph)
+void simpleGraphTest()
{
-
- BOOST_TEST_MESSAGE("simple subgraph");
-
typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property,
property< edge_index_t, int > > >
Graph;
Graph& G1 = G0.create_subgraph();
Graph& G2 = G1.create_subgraph();
- BOOST_CHECK(&G1.parent() == &G0);
- BOOST_CHECK(&G2.parent() == &G1);
+ BOOST_TEST(&G1.parent() == &G0);
+ BOOST_TEST(&G2.parent() == &G1);
enum
{
add_vertex(C, G2); // global vertex C becomes local A2 for G2
add_vertex(E, G2); // global vertex E becomes local B2 for G2
- BOOST_CHECK(num_vertices(G0) == 6);
- BOOST_CHECK(num_vertices(G1) == 3);
+ BOOST_TEST(num_vertices(G0) == 6);
+ BOOST_TEST(num_vertices(G1) == 3);
std::cerr << num_vertices(G1) << std::endl;
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G2) == 2);
// add edges to root graph
add_edge(A, B, G0);
add_edge(B, D, G0);
add_edge(E, F, G0);
- BOOST_CHECK(num_edges(G0) == 4);
- BOOST_CHECK(num_edges(G1) == 1);
- BOOST_CHECK(num_edges(G2) == 0);
+ BOOST_TEST(num_edges(G0) == 4);
+ BOOST_TEST(num_edges(G1) == 1);
+ BOOST_TEST(num_edges(G2) == 0);
// add edges to G1
add_edge(A1, B1, G1);
- BOOST_CHECK(num_edges(G0) == 5);
- BOOST_CHECK(num_edges(G1) == 2);
- BOOST_CHECK(num_edges(G2) == 1);
+ BOOST_TEST(num_edges(G0) == 5);
+ BOOST_TEST(num_edges(G1) == 2);
+ BOOST_TEST(num_edges(G2) == 1);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 6);
- BOOST_CHECK(num_vertices(G1) == 3);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 6);
+ BOOST_TEST(num_vertices(G1) == 3);
+ BOOST_TEST(num_vertices(G2) == 2);
}
-BOOST_AUTO_TEST_CASE(addVertices)
+void addVerticesTest()
{
-
- BOOST_TEST_MESSAGE("subgraph add edges");
-
typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property,
property< edge_index_t, int > > >
Graph;
Graph& G1 = G0.create_subgraph();
Graph& G2 = G1.create_subgraph();
- BOOST_CHECK(&G1.parent() == &G0);
- BOOST_CHECK(&G2.parent() == &G1);
+ BOOST_TEST(&G1.parent() == &G0);
+ BOOST_TEST(&G2.parent() == &G1);
// add vertices to G2
Vertex n1 = add_vertex(0, G2);
// check if the global vertex 2 is equal to the returned local vertex
if (G2.find_vertex(0).second)
{
- BOOST_CHECK(G2.find_vertex(0).first == n1);
+ BOOST_TEST(G2.find_vertex(0).first == n1);
}
else
{
}
if (G2.find_vertex(1).second)
{
- BOOST_CHECK(G2.find_vertex(1).first == n2);
+ BOOST_TEST(G2.find_vertex(1).first == n2);
}
else
{
// and check if this vertex is also present in G1
if (G1.find_vertex(0).second)
{
- BOOST_CHECK(G1.local_to_global(G1.find_vertex(0).first) == 0);
+ BOOST_TEST(G1.local_to_global(G1.find_vertex(0).first) == 0);
}
else
{
}
if (G1.find_vertex(0).second)
{
- BOOST_CHECK(G1.local_to_global(G1.find_vertex(1).first) == 1);
+ BOOST_TEST(G1.local_to_global(G1.find_vertex(1).first) == 1);
}
else
{
}
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 2);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 2);
+ BOOST_TEST(num_vertices(G2) == 2);
// add vertices to G1
Vertex n3 = add_vertex(2, G1);
// check if the global vertex 2 is equal to the returned local vertex
if (G1.find_vertex(2).second)
{
- BOOST_CHECK(G1.find_vertex(2).first == n3);
+ BOOST_TEST(G1.find_vertex(2).first == n3);
}
else
{
BOOST_ERROR("vertex not found!");
}
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 3);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 3);
+ BOOST_TEST(num_vertices(G2) == 2);
// add vertices to G1
Vertex n4 = add_vertex(G1);
// check if the new local vertex is also in the global graph
- BOOST_CHECK(G0.find_vertex(G1.local_to_global(n4)).second);
+ BOOST_TEST(G0.find_vertex(G1.local_to_global(n4)).second);
// check if the new local vertex is not in the subgraphs
- BOOST_CHECK(!G2.find_vertex(n4).second);
+ BOOST_TEST(!G2.find_vertex(n4).second);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 4);
- BOOST_CHECK(num_vertices(G1) == 4);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 4);
+ BOOST_TEST(num_vertices(G1) == 4);
+ BOOST_TEST(num_vertices(G2) == 2);
// add vertices to G0
Vertex n5 = add_vertex(G0);
// check if the new local vertex is not in the subgraphs
- BOOST_CHECK(!G1.find_vertex(n5).second);
- BOOST_CHECK(!G2.find_vertex(n5).second);
+ BOOST_TEST(!G1.find_vertex(n5).second);
+ BOOST_TEST(!G2.find_vertex(n5).second);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 5);
- BOOST_CHECK(num_vertices(G1) == 4);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 5);
+ BOOST_TEST(num_vertices(G1) == 4);
+ BOOST_TEST(num_vertices(G2) == 2);
typedef std::map< graph_traits< Graph::graph_type >::vertex_descriptor,
graph_traits< Graph::graph_type >::vertex_descriptor >::iterator v_itr;
}
}
-BOOST_AUTO_TEST_CASE(addEdge)
+void addEdgeTest()
{
-
- BOOST_TEST_MESSAGE("subgraph add edges");
-
typedef subgraph< adjacency_list< vecS, vecS, directedS, no_property,
property< edge_index_t, int > > >
Graph;
Graph& G1 = G0.create_subgraph();
Graph& G2 = G1.create_subgraph();
- BOOST_CHECK(&G1.parent() == &G0);
- BOOST_CHECK(&G2.parent() == &G1);
+ BOOST_TEST(&G1.parent() == &G0);
+ BOOST_TEST(&G2.parent() == &G1);
// add vertices
add_vertex(0, G2);
add_vertex(1, G2);
- BOOST_CHECK(num_vertices(G1) == 2);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G1) == 2);
+ BOOST_TEST(num_vertices(G2) == 2);
// add edge to G0 which needs propagation
add_edge(0, 1, G0);
- BOOST_CHECK(num_edges(G0) == 1);
- BOOST_CHECK(num_edges(G1) == 1);
- BOOST_CHECK(num_edges(G2) == 1);
+ BOOST_TEST(num_edges(G0) == 1);
+ BOOST_TEST(num_edges(G1) == 1);
+ BOOST_TEST(num_edges(G2) == 1);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 2);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 2);
+ BOOST_TEST(num_vertices(G2) == 2);
// add edge to G0 without propagation
add_edge(1, 2, G0);
- BOOST_CHECK(num_edges(G0) == 2);
- BOOST_CHECK(num_edges(G1) == 1);
- BOOST_CHECK(num_edges(G2) == 1);
+ BOOST_TEST(num_edges(G0) == 2);
+ BOOST_TEST(num_edges(G1) == 1);
+ BOOST_TEST(num_edges(G2) == 1);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 2);
- BOOST_CHECK(num_vertices(G2) == 2);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 2);
+ BOOST_TEST(num_vertices(G2) == 2);
// add vertex 2 to G2/G1 with edge propagation
Vertex n = add_vertex(2, G2);
- BOOST_CHECK(G2.local_to_global(n) == 2);
+ BOOST_TEST(G2.local_to_global(n) == 2);
- BOOST_CHECK(num_edges(G0) == 2);
- BOOST_CHECK(num_edges(G1) == 2);
- BOOST_CHECK(num_edges(G2) == 2);
+ BOOST_TEST(num_edges(G0) == 2);
+ BOOST_TEST(num_edges(G1) == 2);
+ BOOST_TEST(num_edges(G2) == 2);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 3);
- BOOST_CHECK(num_vertices(G2) == 3);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 3);
+ BOOST_TEST(num_vertices(G2) == 3);
// add edge to G2 with propagation upwards
add_edge(0, 2, G2);
- BOOST_CHECK(num_edges(G0) == 3);
- BOOST_CHECK(num_edges(G1) == 3);
- BOOST_CHECK(num_edges(G2) == 3);
+ BOOST_TEST(num_edges(G0) == 3);
+ BOOST_TEST(num_edges(G1) == 3);
+ BOOST_TEST(num_edges(G2) == 3);
// num_vertices stays the same
- BOOST_CHECK(num_vertices(G0) == 3);
- BOOST_CHECK(num_vertices(G1) == 3);
- BOOST_CHECK(num_vertices(G2) == 3);
+ BOOST_TEST(num_vertices(G0) == 3);
+ BOOST_TEST(num_vertices(G1) == 3);
+ BOOST_TEST(num_vertices(G2) == 3);
typedef std::map< graph_traits< Graph::graph_type >::vertex_descriptor,
graph_traits< Graph::graph_type >::vertex_descriptor >::iterator v_itr;
std::cerr << source(e, G2) << "->" << target(e, G2) << std::endl;
}
}
+
+int main()
+{
+ simpleGraphTest();
+ addVerticesTest();
+ addEdgeTest();
+ return boost::report_errors();
+}
projects / ceph.git / blobdiff