Lines Matching refs:g
41 template < class MutableGraph > void modify_demo(MutableGraph& g) in modify_demo() argument
51 = get(edge_name, g); in modify_demo()
56 v = add_vertex(g); in modify_demo()
58 assert(num_vertices(g) == n + 1); in modify_demo()
59 assert(size_type(vertices(g).second - vertices(g).first) == n + 1); in modify_demo()
60 assert(v == *std::find(vertices(g).first, vertices(g).second, v)); in modify_demo()
63 remove_vertex(v, g); in modify_demo()
65 assert(num_vertices(g) == n); in modify_demo()
66 assert(size_type(vertices(g).second - vertices(g).first) == n); in modify_demo()
70 u = add_vertex(g); in modify_demo()
71 v = add_vertex(g); in modify_demo()
73 std::pair< edge_descriptor, bool > p = add_edge(u, v, g); in modify_demo()
75 assert(num_edges(g) == m + 1); in modify_demo()
77 assert(source(p.first, g) == u); in modify_demo()
78 assert(target(p.first, g) == v); in modify_demo()
81 out_edges(u, g).first, out_edges(u, g).second, p.first)); in modify_demo()
84 in_edges(v, g).first, in_edges(v, g).second, p.first)); in modify_demo()
89 u = add_vertex(g); in modify_demo()
90 v = add_vertex(g); in modify_demo()
92 boost::tie(e, added) = add_edge(u, v, g); in modify_demo()
94 assert(num_edges(g) == m + 2); in modify_demo()
96 assert(source(e, g) == u); in modify_demo()
97 assert(target(e, g) == v); in modify_demo()
99 e == *std::find(out_edges(u, g).first, out_edges(u, g).second, e)); in modify_demo()
100 assert(e == *std::find(in_edges(v, g).first, in_edges(v, g).second, e)); in modify_demo()
103 add_edge(u, v, g); // add a parallel edge in modify_demo()
105 remove_edge(u, v, g); in modify_demo()
107 assert(num_edges(g) == m + 1); in modify_demo()
109 boost::tie(e, exists) = edge(u, v, g); in modify_demo()
111 assert(out_degree(u, g) == 0); in modify_demo()
112 assert(in_degree(v, g) == 0); in modify_demo()
115 e = *edges(g).first; in modify_demo()
116 boost::tie(u, v) = incident(e, g); in modify_demo()
118 remove_edge(e, g); in modify_demo()
120 assert(num_edges(g) == m); in modify_demo()
121 assert(out_degree(u, g) == 0); in modify_demo()
122 assert(in_degree(v, g) == 0); in modify_demo()
125 add_edge(u, v, g); in modify_demo()
128 boost::tie(iter, iter_end) = out_edges(u, g); in modify_demo()
130 remove_edge(iter, g); in modify_demo()
132 assert(num_edges(g) == m); in modify_demo()
133 assert(out_degree(u, g) == 0); in modify_demo()
134 assert(in_degree(v, g) == 0); in modify_demo()
137 w = add_vertex(g); in modify_demo()
138 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
139 boost::tie(e2, added) = add_edge(v, w, g); in modify_demo()
144 boost::tie(iter, iter_end) = out_edges(u, g); in modify_demo()
146 remove_edge_if(name_equals("Route 66", name_map), g); in modify_demo()
148 assert(num_edges(g) == m + 1); in modify_demo()
150 remove_edge_if(name_equals("I-5", name_map), g); in modify_demo()
152 assert(num_edges(g) == m); in modify_demo()
153 assert(out_degree(u, g) == 0); in modify_demo()
154 assert(out_degree(v, g) == 0); in modify_demo()
155 assert(in_degree(v, g) == 0); in modify_demo()
156 assert(in_degree(w, g) == 0); in modify_demo()
159 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
160 boost::tie(e2, added) = add_edge(u, w, g); in modify_demo()
164 remove_out_edge_if(u, name_equals("foo", name_map), g); in modify_demo()
166 assert(num_edges(g) == m); in modify_demo()
167 assert(out_degree(u, g) == 0); in modify_demo()
170 boost::tie(e1, added) = add_edge(u, v, g); in modify_demo()
171 boost::tie(e2, added) = add_edge(w, v, g); in modify_demo()
175 remove_in_edge_if(v, name_equals("bar", name_map), g); in modify_demo()
177 assert(num_edges(g) == m); in modify_demo()
178 assert(in_degree(v, g) == 0); in modify_demo()
181 add_edge(u, v, g); in modify_demo()
182 add_edge(u, w, g); in modify_demo()
183 add_edge(u, v, g); in modify_demo()
184 add_edge(v, u, g); in modify_demo()
186 clear_vertex(u, g); in modify_demo()
188 assert(out_degree(u, g) == 0); in modify_demo()
190 for (boost::tie(vi, vi_end) = vertices(g); vi != vi_end; ++vi) in modify_demo()
193 for (boost::tie(ai, ai_end) = adjacent_vertices(*vi, g); in modify_demo()
204 g; in main() local
206 modify_demo(g); in main()