| /third_party/boost/boost/graph/ |
| D | labeled_graph.hpp | 276 typedef Graph graph_type; typedef
304 typedef typename Base::graph_type graph_type; typedef in boost::labeled_graph
305 typedef typename graph_traits< graph_type >::vertex_descriptor
308 typename graph_traits< graph_type >::edge_descriptor edge_descriptor;
309 typedef typename graph_traits< graph_type >::directed_category
311 typedef typename graph_traits< graph_type >::edge_parallel_category
313 typedef typename graph_traits< graph_type >::traversal_category
316 typedef typename graph_traits< graph_type >::out_edge_iterator
319 typename graph_traits< graph_type >::in_edge_iterator in_edge_iterator;
320 typedef typename graph_traits< graph_type >::adjacency_iterator
[all …]
|
| D | directed_graph.hpp | 59 graph_type; typedef in boost::directed_graph
63 typedef typename graph_type::vertex_list_selector vertex_list_selector;
64 typedef typename graph_type::edge_list_selector edge_list_selector;
65 typedef typename graph_type::out_edge_list_selector out_edge_list_selector;
66 typedef typename graph_type::directed_selector directed_selector;
70 typedef typename graph_type::stored_vertex stored_vertex;
71 typedef typename graph_type::vertices_size_type vertices_size_type;
72 typedef typename graph_type::edges_size_type edges_size_type;
73 typedef typename graph_type::degree_size_type degree_size_type;
74 typedef typename graph_type::vertex_descriptor vertex_descriptor;
[all …]
|
| D | undirected_graph.hpp | 59 graph_type; typedef in boost::undirected_graph
63 typedef typename graph_type::vertex_list_selector vertex_list_selector;
64 typedef typename graph_type::edge_list_selector edge_list_selector;
65 typedef typename graph_type::out_edge_list_selector out_edge_list_selector;
66 typedef typename graph_type::directed_selector directed_selector;
70 typedef typename graph_type::stored_vertex stored_vertex;
71 typedef typename graph_type::vertices_size_type vertices_size_type;
72 typedef typename graph_type::edges_size_type edges_size_type;
73 typedef typename graph_type::degree_size_type degree_size_type;
74 typedef typename graph_type::vertex_descriptor vertex_descriptor;
[all …]
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 582 typedef typename Config::graph_type graph_type; in remove_edge() typedef
583 graph_type& g = static_cast< graph_type& >(*this); in remove_edge()
592 typedef typename Config::graph_type graph_type; in remove_edge() typedef
593 graph_type& g = static_cast< graph_type& >(*this); in remove_edge()
606 typedef typename Config::graph_type graph_type; in edges() typedef
608 const graph_type& cg = static_cast< const graph_type& >(g_); in edges()
609 graph_type& g = const_cast< graph_type& >(cg); in edges()
638 typedef typename Config::graph_type graph_type; in remove_edge() typedef
640 graph_type& g = static_cast< graph_type& >(g_); in remove_edge()
648 typedef typename Config::graph_type graph_type; in remove_out_edge_if() typedef
[all …]
|
| /third_party/boost/libs/graph/example/ |
| D | vf2_sub_graph_iso_multi_example.cpp | 22 graph_type; in main() typedef
25 graph_type graph1; in main()
41 graph_type graph2; in main()
72 typedef property_map< graph_type, vertex_name_t >::type vertex_name_map_t; in main()
78 typedef property_map< graph_type, edge_name_t >::type edge_name_map_t; in main()
85 vf2_print_callback< graph_type, graph_type > callback(graph1, graph2); in main()
|
| D | vf2_sub_graph_iso_example.cpp | 16 typedef adjacency_list< setS, vecS, bidirectionalS > graph_type; in main() typedef
20 graph_type graph1(num_vertices1); in main()
32 graph_type graph2(num_vertices2); in main()
45 vf2_print_callback< graph_type, graph_type > callback(graph1, graph2); in main()
|
| D | last-mod-time.cpp | 67 graph_type; in main() typedef
69 graph_type g; // use default constructor to create empty graph in main()
79 property_map< graph_type, vertex_name_t >::type name_map in main()
87 property_map< graph_type, vertex_index_t >::type, time_t, time_t& > in main()
92 property_map< graph_type, vertex_name_t >::type name = get(vertex_name, g); in main()
94 graph_traits< graph_type >::vertex_descriptor u; in main()
95 typedef graph_traits< graph_type >::vertex_iterator vertex_iter_t; in main()
|
| D | ordered_out_edges.cpp | 104 graph_type; in main()
105 graph_type g; in main()
115 property_map< graph_type, vertex_index_t >::type id = get(vertex_index, g); in main()
116 property_map< graph_type, edge_name_t >::type name = get(edge_name, g); in main()
118 graph_traits< graph_type >::vertex_iterator i, end; in main()
119 graph_traits< graph_type >::out_edge_iterator ei, edge_end; in main()
131 typedef graph_traits< graph_type > Traits; in main()
|
| D | edge-function.cpp | 85 graph_type; in main() typedef
87 graph_type g; // use default constructor to create empty graph in main()
108 property_map< graph_type, vertex_name_t >::type name_map in main()
112 graph_traits< graph_type >::vertex_descriptor yow, zag, bar; in main()
114 typedef property_map< graph_type, vertex_name_t >::type name_map_t; in main()
117 graph_traits< graph_type >::vertex_iterator i, end; in main()
129 graph_traits< graph_type >::edge_descriptor e1, e2; in main()
|
| D | edge-iter-constructor.cpp | 29 graph_type; in main() typedef
32 typedef graph_traits< graph_type >::vertices_size_type size_type; in main()
36 graph_type g(n_vertices); // create graph with n vertices in main()
39 graph_traits< graph_type >::vertices_size_type u, v; in main()
|
| D | gerdemann.cpp | 120 graph_type; in main()
122 graph_type g; in main()
134 property_map< graph_type, vertex_index_t >::type id = get(vertex_index, g); in main()
135 property_map< graph_type, edge_name_t >::type name = get(edge_name, g); in main()
137 graph_traits< graph_type >::vertex_iterator i, end; in main()
138 graph_traits< graph_type >::out_edge_iterator ei, edge_end; in main()
151 merge_vertex(0, 1, g, get_edge_name< graph_type >(g)); in main()
|
| D | print-out-edges.cpp | 83 graph_type; in main() typedef
85 graph_type g; // use default constructor to create empty graph in main()
104 property_map< graph_type, vertex_name_t >::type name_map in main()
108 graph_traits< graph_type >::vertex_iterator i, end; in main()
110 typedef property_map< graph_type, vertex_name_t >::type name_map_t; in main()
|
| D | vertex-name-property.cpp | 48 graph_type; in main() typedef
50 graph_type g; // use default constructor to create empty graph in main()
70 property_map< graph_type, vertex_name_t >::type name_map in main()
78 property_map< graph_type, vertex_index_t >::type, time_t, time_t& > in main()
|
| D | print-adjacent-vertices.cpp | 85 graph_type; in main() typedef
87 graph_type g; // use default constructor to create empty graph in main()
106 property_map< graph_type, vertex_name_t >::type name_map in main()
110 graph_traits< graph_type >::vertex_iterator i, end; in main()
|
| D | print-in-edges.cpp | 84 graph_type; in main() typedef
86 graph_type g; // use default constructor to create empty graph in main()
106 property_map< graph_type, vertex_name_t >::type name_map in main()
110 graph_traits< graph_type >::vertex_iterator i, end; in main()
|
| D | print-edges.cpp | 58 graph_type; in main() typedef
60 graph_type g; // use default constructor to create empty graph in main()
80 property_map< graph_type, vertex_name_t >::type name_map in main()
|
| D | default-constructor.cpp | 36 graph_type; in main() typedef
38 graph_type g; // use default constructor to create empty graph in main()
|
| D | default-constructor2.cpp | 39 graph_type; in main() typedef
41 graph_type g; // use default constructor to create empty graph in main()
|
| /third_party/boost/libs/graph/test/ |
| D | gursoy_atun_layout_test.cpp | 57 graph_type; in main() typedef
58 typedef boost::graph_traits< graph_type >::vertex_descriptor in main()
64 graph_type graph; in main()
103 graph_type graph(plod_iterator<minstd_rand, graph_type>(gen, n, alpha, beta), in main()
104 plod_iterator<minstd_rand, graph_type>(), in main()
111 graph_type graph(small_world_iterator< minstd_rand >(gen, n, k, p), in main()
117 typedef boost::property_map< graph_type, boost::vertex_index_t >::type in main()
|
| D | random_spanning_tree_test.cpp | 27 typedef grid_graph< 2 > graph_type; typedef
28 typedef graph_traits< graph_type > gt;
66 graph_type g(sizes); in main()
69 property_map< graph_type, vertex_index_t >::const_type > in main()
72 property_map< graph_type, edge_index_t >::const_type > in main()
75 BGL_FORALL_EDGES(e, g, graph_type) in main()
|
| D | subgraph_add.cpp | 204 typedef std::map< graph_traits< Graph::graph_type >::vertex_descriptor, in BOOST_AUTO_TEST_CASE()
205 graph_traits< Graph::graph_type >::vertex_descriptor >::iterator v_itr; in BOOST_AUTO_TEST_CASE()
293 typedef std::map< graph_traits< Graph::graph_type >::vertex_descriptor, in BOOST_AUTO_TEST_CASE()
294 graph_traits< Graph::graph_type >::vertex_descriptor >::iterator v_itr; in BOOST_AUTO_TEST_CASE()
|
| /third_party/boost/boost/polygon/detail/ |
| D | polygon_45_touch.hpp | 188 template <typename graph_type>
189 static void performTouch(graph_type& graph, TouchSetData& tsd) { in performTouch()
204 std::pair<std::pair<Unit, std::map<Unit, std::set<int> > >, graph_type*> output in performTouch()
|
| /third_party/boost/libs/geometry/example/ |
| D | 07_b_graph_route_example.cpp | 265 > graph_type; in main() typedef
267 typedef boost::graph_traits<graph_type>::vertex_descriptor vertex_type; in main()
274 graph_type graph; in main()
|
| D | 07_a_graph_route_example.cpp | 278 > graph_type; in main() typedef
280 typedef boost::graph_traits<graph_type>::vertex_descriptor vertex_type; in main()
298 graph_type graph; in main()
|
| /third_party/boost/boost/graph/distributed/ |
| D | adjacency_list.hpp | 619 graph_type; typedef
760 typedef Graph graph_type; typedef
761 typedef typename graph_type::process_group_type process_group_type;
762 typedef typename graph_type::inherited base_graph_type;
768 typedef graph_traits<graph_type> traits;
769 typedef typename graph_type::local_vertex_descriptor local_vertex;
1327 typedef typename config_type::graph_type graph_type; typedef in boost::adjacency_list
1438 typedef graph::distributed::maybe_named_graph<graph_type,
2294 = static_cast<graph_type&>(self).owner_by_property(property); in ~lazy_add_vertex_with_property()
2319 = static_cast<graph_type&>(self).owner_by_property(property); in commit()
[all …]
|