Home
last modified time | relevance | path

Searched refs:add_vertex (Results 1 – 25 of 113) sorted by relevance

12345

/third_party/boost/libs/graph/example/
Dlabeled_graph.cpp35 add_vertex(1, g); in main()
36 add_vertex(2, g); in main()
44 add_vertex("foo", g); in main()
45 add_vertex("bar", g); in main()
51 add_vertex("foo", g); in main()
52 add_vertex("bar", g); in main()
53 add_vertex("foo", g); in main()
60 add_vertex(12, h); in main()
68 add_vertex(0, g); in main()
69 add_vertex(1, g); in main()
Dvf2_sub_graph_iso_multi_example.cpp27 add_vertex(vertex_property('a'), graph1); in main()
28 add_vertex(vertex_property('a'), graph1); in main()
29 add_vertex(vertex_property('a'), graph1); in main()
43 add_vertex(vertex_property('a'), graph2); in main()
44 add_vertex(vertex_property('a'), graph2); in main()
45 add_vertex(vertex_property('a'), graph2); in main()
46 add_vertex(vertex_property('a'), graph2); in main()
47 add_vertex(vertex_property('a'), graph2); in main()
48 add_vertex(vertex_property('a'), graph2); in main()
Dtopo-sort-with-leda.cpp23 vert[0] = add_vertex(std::string("pick up kids from school"), leda_g); in main()
24 vert[1] = add_vertex(std::string("buy groceries (and snacks)"), leda_g); in main()
25 vert[2] = add_vertex(std::string("get cash at ATM"), leda_g); in main()
27 = add_vertex(std::string("drop off kids at soccer practice"), leda_g); in main()
28 vert[4] = add_vertex(std::string("cook dinner"), leda_g); in main()
29 vert[5] = add_vertex(std::string("pick up kids from soccer"), leda_g); in main()
30 vert[6] = add_vertex(std::string("eat dinner"), leda_g); in main()
Dmcgregor_subgraphs_example.cpp94 put(vname_map_simple1, add_vertex(graph_simple1), 1); in main()
95 put(vname_map_simple1, add_vertex(graph_simple1), 2); in main()
96 put(vname_map_simple1, add_vertex(graph_simple1), 3); in main()
107 put(vname_map_simple2, add_vertex(graph_simple2), 1); in main()
108 put(vname_map_simple2, add_vertex(graph_simple2), 2); in main()
109 put(vname_map_simple2, add_vertex(graph_simple2), 3); in main()
110 put(vname_map_simple2, add_vertex(graph_simple2), 4); in main()
Dsubgraph.cpp74 add_vertex(C, G1); // global vertex C becomes local A1 for G1 in main()
75 add_vertex(E, G1); // global vertex E becomes local B1 for G1 in main()
76 add_vertex(F, G1); // global vertex F becomes local C1 for G1 in main()
78 add_vertex(A, G2); // global vertex A becomes local A1 for G2 in main()
79 add_vertex(B, G2); // global vertex B becomes local B1 for G2 in main()
Dbfs-name-printer.cpp20 a = add_vertex(g); in build_router_network()
22 b = add_vertex(g); in build_router_network()
24 c = add_vertex(g); in build_router_network()
26 d = add_vertex(g); in build_router_network()
28 e = add_vertex(g); in build_router_network()
Dundirected_graph.cpp21 boost::graph_traits< Graph >::vertex_descriptor v0 = g.add_vertex(); in main()
22 boost::graph_traits< Graph >::vertex_descriptor v1 = g.add_vertex(); in main()
23 boost::graph_traits< Graph >::vertex_descriptor v2 = g.add_vertex(); in main()
Dsubgraph_properties.cpp79 add_vertex(C, G1); // global vertex C becomes local A1 for G1 in main()
80 add_vertex(E, G1); // global vertex E becomes local B1 for G1 in main()
81 add_vertex(F, G1); // global vertex F becomes local C1 for G1 in main()
120 add_vertex(A, G2); // global vertex A becomes local A2 for G2 in main()
121 add_vertex(C, G2); // global vertex C becomes local B2 for G2 in main()
Dquick-tour.cpp61 a = add_vertex(g); in build_router_network()
63 b = add_vertex(g); in build_router_network()
65 c = add_vertex(g); in build_router_network()
67 d = add_vertex(g); in build_router_network()
69 e = add_vertex(g); in build_router_network()
Dgraph_as_tree.cpp42 vertex_t a = add_vertex(g), b = add_vertex(g), c = add_vertex(g); in main()
Dmodify_graph.cpp56 v = add_vertex(g); in modify_demo()
70 u = add_vertex(g); in modify_demo()
71 v = add_vertex(g); in modify_demo()
89 u = add_vertex(g); in modify_demo()
90 v = add_vertex(g); in modify_demo()
137 w = add_vertex(g); in modify_demo()
/third_party/boost/libs/graph/test/
Dbasic_planarity_test.cpp42 vertex_t v1 = add_vertex(g); in test_K_5()
43 vertex_t v2 = add_vertex(g); in test_K_5()
44 vertex_t v3 = add_vertex(g); in test_K_5()
45 vertex_t v4 = add_vertex(g); in test_K_5()
46 vertex_t v5 = add_vertex(g); in test_K_5()
80 vertex_t v1 = add_vertex(g); in test_K_3_3()
81 vertex_t v2 = add_vertex(g); in test_K_3_3()
82 vertex_t v3 = add_vertex(g); in test_K_3_3()
83 vertex_t v4 = add_vertex(g); in test_K_3_3()
84 vertex_t v5 = add_vertex(g); in test_K_3_3()
[all …]
Dsubgraph_add.cpp69 add_vertex(C, G1); // global vertex C becomes local A1 for G1 in BOOST_AUTO_TEST_CASE()
70 add_vertex(E, G1); // global vertex E becomes local B1 for G1 in BOOST_AUTO_TEST_CASE()
71 add_vertex(F, G1); // global vertex F becomes local C1 for G1 in BOOST_AUTO_TEST_CASE()
73 add_vertex(C, G2); // global vertex C becomes local A2 for G2 in BOOST_AUTO_TEST_CASE()
74 add_vertex(E, G2); // global vertex E becomes local B2 for G2 in BOOST_AUTO_TEST_CASE()
121 Vertex n1 = add_vertex(0, G2); in BOOST_AUTO_TEST_CASE()
122 Vertex n2 = add_vertex(1, G2); in BOOST_AUTO_TEST_CASE()
164 Vertex n3 = add_vertex(2, G1); in BOOST_AUTO_TEST_CASE()
180 Vertex n4 = add_vertex(G1); in BOOST_AUTO_TEST_CASE()
193 Vertex n5 = add_vertex(G0); in BOOST_AUTO_TEST_CASE()
[all …]
Dadj_list_invalidation.cpp31 Vertex u = add_vertex(10, g); in make_graph()
32 Vertex v = add_vertex(20, g); in make_graph()
62 add_vertex(g); in invalidate_edges()
79 add_vertex(g); in invalidate_vertices()
96 add_vertex(g); in invalidate_out_edges()
113 add_vertex(g); in invalidate_adj_verts()
Ddag_longest_paths.cpp25 (void)add_vertex(graph); in main()
26 (void)add_vertex(graph); in main()
27 (void)add_vertex(graph); in main()
28 (void)add_vertex(graph); in main()
Dlabeled_graph.cpp57 add_vertex(i, g); in init_graph()
134 add_vertex(bacon, g); in test_bacon()
135 add_vertex(slater, g); in test_bacon()
145 add_vertex(bacon, g); in test_bacon()
146 add_vertex(slater, g); in test_bacon()
Dr_c_shortest_paths_test.cpp293 add_vertex(SPPRC_Example_Graph_Vert_Prop(0, 0, 1000000000), g); in main()
294 add_vertex(SPPRC_Example_Graph_Vert_Prop(1, 56, 142), g); in main()
295 add_vertex(SPPRC_Example_Graph_Vert_Prop(2, 0, 1000000000), g); in main()
296 add_vertex(SPPRC_Example_Graph_Vert_Prop(3, 89, 178), g); in main()
297 add_vertex(SPPRC_Example_Graph_Vert_Prop(4, 0, 1000000000), g); in main()
298 add_vertex(SPPRC_Example_Graph_Vert_Prop(5, 49, 76), g); in main()
299 add_vertex(SPPRC_Example_Graph_Vert_Prop(6, 0, 1000000000), g); in main()
300 add_vertex(SPPRC_Example_Graph_Vert_Prop(7, 98, 160), g); in main()
301 add_vertex(SPPRC_Example_Graph_Vert_Prop(8, 0, 1000000000), g); in main()
302 add_vertex(SPPRC_Example_Graph_Vert_Prop(9, 90, 158), g); in main()
[all …]
Dnamed_vertices_test.cpp70 Vertex bloomington = add_vertex(City("Bloomington", 69291), map); in main()
71 Vertex indianapolis = add_vertex(City("Indianapolis", 791926), map); in main()
72 Vertex chicago = add_vertex(City("Chicago", 9500000), map); in main()
74 BOOST_TEST(add_vertex(City("Bloomington", 69291), map) == bloomington); in main()
Ddelete_edge.cpp37 VertexType v1 = boost::add_vertex(m_graph); in main()
38 VertexType v2 = boost::add_vertex(m_graph); in main()
39 VertexType v3 = boost::add_vertex(m_graph); in main()
Dfinish_edge_bug.cpp68 Vertex a = add_vertex(G); in main()
69 Vertex b = add_vertex(G); in main()
70 Vertex c = add_vertex(G); in main()
Dmcgregor_subgraphs_test.cpp261 Vertex new_vertex = add_vertex(graph); in add_random_vertices()
364 put(vname_map_common, add_vertex(common_subgraph), generator()); in main()
436 put(vname_map_simple1, add_vertex(graph_simple1), 1); in main()
437 put(vname_map_simple1, add_vertex(graph_simple1), 2); in main()
438 put(vname_map_simple1, add_vertex(graph_simple1), 3); in main()
444 put(vname_map_simple2, add_vertex(graph_simple2), 1); in main()
445 put(vname_map_simple2, add_vertex(graph_simple2), 2); in main()
446 put(vname_map_simple2, add_vertex(graph_simple2), 3); in main()
447 put(vname_map_simple2, add_vertex(graph_simple2), 4); in main()
/third_party/boost/boost/graph/
Dnamed_graph.hpp388 add_vertex(typename BGL_NAMED_GRAPH::vertex_name_type const& name, in add_vertex() function
396 return add_vertex(g.vertex_constructor(name), g.derived()); in add_vertex()
406 return add_edge(add_vertex(u_name, g.derived()), in add_edge()
407 add_vertex(v_name, g.derived()), g.derived()); in add_edge()
417 return add_edge(u, add_vertex(v_name, g.derived()), g.derived()); in add_edge()
427 return add_edge(add_vertex(u_name, g.derived()), v, g.derived()); in add_edge()
437 return add_edge(u, add_vertex(v_name, g.derived()), p, g.derived()); in add_edge()
446 return add_edge(add_vertex(u_name, g.derived()), v, p, g.derived()); in add_edge()
455 return add_edge(add_vertex(u_name, g.derived()), in add_edge()
456 add_vertex(v_name, g.derived()), p, g.derived()); in add_edge()
Dlabeled_graph.hpp138 Vertex v = add_vertex(p, g); in insert_labeled_vertex()
153 Vertex v = add_vertex(p, g); in insert_labeled_vertex()
172 x.first->second = add_vertex(g); in insert_labeled_vertex()
374 add_vertex(*l++); in labeled_graph()
385 add_vertex(*l++, *p++); in labeled_graph()
418 vertex_descriptor add_vertex(Label const& l) in add_vertex() function in boost::labeled_graph
425 vertex_descriptor add_vertex(Label const& l, vertex_property_type const& p) in add_vertex() function in boost::labeled_graph
566 vertex_descriptor add_vertex(Label const& l) in add_vertex() function in boost::labeled_graph
573 vertex_descriptor add_vertex(Label const& l, vertex_property_type const& p) in add_vertex() function in boost::labeled_graph
929 inline typename LABELED_GRAPH::vertex_descriptor add_vertex( in add_vertex() function
[all …]
/third_party/boost/libs/graph_parallel/test/
Dnamed_vertices_seq.cpp66 Vertex bloomington = add_vertex(City("Bloomington", 69291), map); in test_main()
67 Vertex indianapolis = add_vertex(City("Indianapolis", 791926), map); in test_main()
68 Vertex chicago = add_vertex(City("Chicago", 9500000), map); in test_main()
70 BOOST_CHECK(add_vertex(City("Bloomington", 69291), map) == bloomington); in test_main()
/third_party/boost/boost/graph/distributed/
Dnamed_graph.hpp387 add_vertex(self.derived().base().vertex_constructor(name), self.derived()); in ~lazy_add_vertex()
404 return add_vertex(self.derived().base().vertex_constructor(name), in commit()
571 v = add_vertex(*v_name, self.derived()); in commit()
773 v = add_vertex(*v_name, self.derived()); in commit()
924 add_vertex(typename Graph::vertex_name_type const& name, in add_vertex() function
950 return lazy_add_edge(g, add_vertex(u_name, g), add_vertex(v_name, g)); in add_edge()
952 return lazy_add_edge(g, add_vertex(u_name, g), v_name); in add_edge()
954 return lazy_add_edge(g, u_name, add_vertex(v_name, g)); in add_edge()
969 return lazy_add_edge(g, add_vertex(u_name, g), v); in add_edge()
984 return lazy_add_edge(g, u, add_vertex(v_name, g)); in add_edge()
[all …]

12345