#include <boost/test/auto_unit_test.hpp>
#include "testsuite.hh"
#include <boost/graph/adjacency_list.hpp>
#include <utilmm/iterator_sequence.hh>
#include <utilmm/undirected_graph.hh>
#include <utilmm/undirected_dfs.hh>
#include <vector>
#include <boost/concept_check.hpp>
#include <boost/graph/connected_components.hpp>
#include <boost/graph/depth_first_search.hpp>
#include <boost/graph/breadth_first_search.hpp>
Go to the source code of this file.
Typedefs | |
typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property < boost::edge_color_t, boost::default_color_type > > | BaseGraph |
typedef undirected_graph < BaseGraph, const BaseGraph & > | UndirectedGraph |
Functions | |
BOOST_AUTO_TEST_CASE (test_iterator_sequence) | |
BOOST_AUTO_TEST_CASE (test_undirected_property_maps_adaptor) | |
BOOST_AUTO_TEST_CASE (test_undirected_incidence) | |
BOOST_CLASS_REQUIRE (UndirectedGraph, boost, AdjacencyGraphConcept) | |
BOOST_CLASS_REQUIRE (UndirectedGraph, boost, IncidenceGraphConcept) |
typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::bidirectionalS, boost::no_property, boost::property<boost::edge_color_t, boost::default_color_type> > BaseGraph |
Definition at line 66 of file test_undirected_graph.cc.
typedef undirected_graph< BaseGraph, const BaseGraph& > UndirectedGraph |
Definition at line 67 of file test_undirected_graph.cc.
BOOST_AUTO_TEST_CASE | ( | test_iterator_sequence | ) |
Definition at line 17 of file test_undirected_graph.cc.
BOOST_AUTO_TEST_CASE | ( | test_undirected_property_maps_adaptor | ) |
Definition at line 71 of file test_undirected_graph.cc.
BOOST_AUTO_TEST_CASE | ( | test_undirected_incidence | ) |
Definition at line 91 of file test_undirected_graph.cc.
BOOST_CLASS_REQUIRE | ( | UndirectedGraph | , |
boost | , | ||
AdjacencyGraphConcept | |||
) |
BOOST_CLASS_REQUIRE | ( | UndirectedGraph | , |
boost | , | ||
IncidenceGraphConcept | |||
) |