28 template < typename Graph > struct graph_test  struct
31     typedef typename graph_traits< Graph >::vertex_descriptor vertex_t;
32     typedef typename graph_traits< Graph >::edge_descriptor edge_t;
33     typedef typename graph_traits< Graph >::vertices_size_type v_size_t;
34     typedef typename graph_traits< Graph >::degree_size_type deg_size_t;
35     typedef typename graph_traits< Graph >::edges_size_type e_size_t;
36     typedef typename graph_traits< Graph >::out_edge_iterator out_edge_iter;
37     typedef typename property_map< Graph, vertex_index_t >::type index_map_t;
40         IsoMap;
42     struct ignore_vertex
49     struct ignore_edge
56     struct ignore_edges
73     void test_incidence_graph(const std::vector< vertex_t >& vertex_set,  in test_incidence_graph()
103     void test_bidirectional_graph(const std::vector< vertex_t >& vertex_set,  in test_bidirectional_graph()
133     void test_adjacency_graph(const std::vector< vertex_t >& vertex_set,  in test_adjacency_graph()
161     void test_vertex_list_graph(  in test_vertex_list_graph()
176     void test_edge_list_graph(const std::vector< vertex_t >& vertex_set,  in test_edge_list_graph()
196     void test_adjacency_matrix(const std::vector< vertex_t >& vertex_set,  in test_adjacency_matrix()
227     void test_add_vertex(Graph& g)  in test_add_vertex()
248     void test_add_edge(vertex_t u, vertex_t v, Graph& g)  in test_add_edge()
292     void test_remove_edge(vertex_t u, vertex_t v, Graph& g)  in test_remove_edge()
308     void test_remove_edge(edge_t e, Graph& g)  in test_remove_edge()
326     void test_clear_vertex(vertex_t v, Graph& g)  in test_clear_vertex()
345     void test_readable_vertex_property_graph(  in test_readable_vertex_property_graph()
372     void test_vertex_property_graph(  in test_vertex_property_graph()