#include <graph_test.hpp>
Classes | |
struct | ignore_edge |
struct | ignore_edges |
struct | ignore_vertex |
Public Types | |
typedef graph_traits< Graph > ::vertex_descriptor | vertex_t |
typedef graph_traits< Graph > ::edge_descriptor | edge_t |
typedef graph_traits< Graph > ::vertices_size_type | v_size_t |
typedef graph_traits< Graph > ::degree_size_type | deg_size_t |
typedef graph_traits< Graph > ::edges_size_type | e_size_t |
typedef graph_traits< Graph > ::out_edge_iterator | out_edge_iter |
typedef property_map< Graph, vertex_index_t >::type | index_map_t |
typedef iterator_property_map < typename std::vector < vertex_t >::iterator, index_map_t, vertex_t, vertex_t & > | IsoMap |
Public Member Functions | |
void | test_incidence_graph (const std::vector< vertex_t > &vertex_set, const std::vector< std::pair< vertex_t, vertex_t > > &edge_set, const Graph &g) |
void | test_bidirectional_graph (const std::vector< vertex_t > &vertex_set, const std::vector< std::pair< vertex_t, vertex_t > > &edge_set, const Graph &g) |
void | test_adjacency_graph (const std::vector< vertex_t > &vertex_set, const std::vector< std::pair< vertex_t, vertex_t > > &edge_set, const Graph &g) |
void | test_vertex_list_graph (const std::vector< vertex_t > &vertex_set, const Graph &g) |
void | test_edge_list_graph (const std::vector< vertex_t > &vertex_set, const std::vector< std::pair< vertex_t, vertex_t > > &edge_set, const Graph &g) |
void | test_adjacency_matrix (const std::vector< vertex_t > &vertex_set, const std::vector< std::pair< vertex_t, vertex_t > > &edge_set, const Graph &g) |
void | test_add_vertex (Graph &g) |
void | test_add_edge (vertex_t u, vertex_t v, Graph &g) |
void | test_remove_edge (vertex_t u, vertex_t v, Graph &g) |
void | test_remove_edge (edge_t e, Graph &g) |
void | test_clear_vertex (vertex_t v, Graph &g) |
template<typename PropVal , typename PropertyTag > | |
void | test_readable_vertex_property_graph (const std::vector< PropVal > &vertex_prop, PropertyTag tag, const Graph &g) |
template<typename PropVal , typename PropertyTag > | |
void | test_vertex_property_graph (const std::vector< PropVal > &vertex_prop, PropertyTag tag, Graph &g) |
typedef graph_traits<Graph>::degree_size_type boost::graph_test< Graph >::deg_size_t |
typedef graph_traits<Graph>::edges_size_type boost::graph_test< Graph >::e_size_t |
typedef graph_traits<Graph>::edge_descriptor boost::graph_test< Graph >::edge_t |
typedef property_map<Graph, vertex_index_t>::type boost::graph_test< Graph >::index_map_t |
typedef iterator_property_map<typename std::vector<vertex_t>::iterator, index_map_t,vertex_t,vertex_t&> boost::graph_test< Graph >::IsoMap |
typedef graph_traits<Graph>::out_edge_iterator boost::graph_test< Graph >::out_edge_iter |
typedef graph_traits<Graph>::vertices_size_type boost::graph_test< Graph >::v_size_t |
typedef graph_traits<Graph>::vertex_descriptor boost::graph_test< Graph >::vertex_t |
|
inline |
References boost::add_edge(), boost::adjacent_vertices(), boost::allows_parallel_edges(), BOOST_CHECK, boost::copy_graph(), boost::is_undirected(), boost::make_filtered_graph(), boost::num_edges(), boost::num_vertices(), boost::orig_to_copy(), boost::out_edges(), boost::multiprecision::backends::p, boost::source(), boost::target(), boost::verify_isomorphism(), and boost::vertex_index.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |