Lines Matching refs:g_s
64 Subgraph& g_s = g.create_subgraph(); in main() local
77 Vertex v = add_vertex(v_global, g_s); in main()
90 gt.test_incidence_graph(sub_vertex_set, sub_edge_set, g_s); in main()
91 gt.test_bidirectional_graph(sub_vertex_set, sub_edge_set, g_s); in main()
92 gt.test_adjacency_graph(sub_vertex_set, sub_edge_set, g_s); in main()
93 gt.test_vertex_list_graph(sub_vertex_set, g_s); in main()
94 gt.test_edge_list_graph(sub_vertex_set, sub_edge_set, g_s); in main()
95 gt.test_adjacency_matrix(sub_vertex_set, sub_edge_set, g_s); in main()
97 if (num_vertices(g_s) == 0) in main()
102 ColorMap colors = get(&node::color, g_s); in main()
103 for (std::pair< VertexIter, VertexIter > r = vertices(g_s); in main()
109 WeightMap weights = get(&arc::weight, g_s); in main()
110 for (std::pair< EdgeIter, EdgeIter > r = edges(g_s); in main()