| /third_party/boost/libs/graph/example/ |
| D | implicit_graph.cpp | 131 typedef ring_incident_edge_iterator out_edge_iterator; typedef in ring_graph
166 typedef boost::graph_traits< ring_graph >::out_edge_iterator out_edge_iterator; typedef
251 std::pair< out_edge_iterator, out_edge_iterator > out_edges( in out_edges()
254 return std::pair< out_edge_iterator, out_edge_iterator >( in out_edges()
255 out_edge_iterator(g, u, iterator_start()), in out_edges()
256 out_edge_iterator(g, u, iterator_end())); in out_edges()
294 out_edge_iterator >::type
299 out_edge_iterator >::type parent_class;
305 : parent_class(out_edge_iterator(g, u, iterator_start()), &g) {}; in ring_adjacency_iterator()
308 : parent_class(out_edge_iterator(g, u, iterator_end()), &g) {}; in ring_adjacency_iterator()
[all …]
|
| D | read_write_dimacs-eg.cpp | 72 typedef graph_traits< Graph >::out_edge_iterator out_edge_iterator; in main() typedef
95 out_edge_iterator oei, oe_end; in main()
|
| D | filtered_graph_edge_range.cpp | 71 graph_traits< Graph >::out_edge_iterator f, l; in main()
82 graph_traits< FGraph >::out_edge_iterator first, last; in main()
|
| D | ordered_out_edges.cpp | 119 graph_traits< graph_type >::out_edge_iterator ei, edge_end; in main()
133 Traits::out_edge_iterator e_first, e_last; in main()
|
| D | edge_property.cpp | 80 typename boost::graph_traits< Graph >::out_edge_iterator OutEdgeIter; in print_network()
153 boost::graph_traits< Graph >::out_edge_iterator e, e_end; in main()
|
| D | undirected_adjacency_list.cpp | 18 typename graph_traits< UndirectedGraph >::out_edge_iterator out, out_end; in undirected_graph_demo1()
94 typename boost::graph_traits< UndirectedGraph >::out_edge_iterator e, e_end; in undirected_graph_demo2()
|
| D | gerdemann.cpp | 47 typename Traits::out_edge_iterator out_i, out_end; in merge_vertex()
138 graph_traits< graph_type >::out_edge_iterator ei, edge_end; in main()
|
| /third_party/boost/boost/graph/ |
| D | graph_archetypes.hpp | 54 typedef input_iterator_archetype< edge_descriptor > out_edge_iterator; typedef
82 std::pair< typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator,
83 typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator >
86 typedef typename incidence_graph_archetype< V, D, P, B >::out_edge_iterator in out_edges()
118 typedef void out_edge_iterator; typedef
163 typedef typename Incidence::out_edge_iterator out_edge_iterator; typedef
|
| D | filtered_graph.hpp | 185 typedef filter_iterator< OutEdgePred, typename Traits::out_edge_iterator >
186 out_edge_iterator; typedef in boost::filtered_graph
192 out_edge_iterator >::type adjacency_iterator;
376 std::pair< typename filtered_graph< G, EP, VP >::out_edge_iterator,
377 typename filtered_graph< G, EP, VP >::out_edge_iterator >
383 typedef typename Graph::out_edge_iterator iter; in out_edges()
384 typename graph_traits< G >::out_edge_iterator f, l; in out_edges()
395 typename filtered_graph< G, EP, VP >::out_edge_iterator f, l; in out_degree()
409 typename Graph::out_edge_iterator f, l; in adjacent_vertices()
472 std::pair< typename filtered_graph< G, EP, VP >::out_edge_iterator,
[all …]
|
| D | matrix_as_graph.hpp | 42 out_edge_iterator; \
54 friend std::pair< out_edge_iterator, out_edge_iterator > \
57 typedef out_edge_iterator IncIter; \
|
| D | leda_graph.hpp | 76 class out_edge_iterator class
77 : public iterator_facade< out_edge_iterator, leda::edge,
81 out_edge_iterator( in out_edge_iterator() function in boost::graph_traits::out_edge_iterator
90 bool equal(const out_edge_iterator& other) const in equal()
228 class out_edge_iterator class
229 : public iterator_facade< out_edge_iterator, leda::edge,
233 out_edge_iterator(leda::edge edge = 0, const leda::graph* g = 0) in out_edge_iterator() function in boost::graph_traits::out_edge_iterator
241 bool equal(const out_edge_iterator& other) const in equal()
393 typename graph_traits< leda::GRAPH< vtype, etype > >::out_edge_iterator,
394 typename graph_traits< leda::GRAPH< vtype, etype > >::out_edge_iterator >
[all …]
|
| D | push_relabel_max_flow.hpp | 64 typedef typename Traits::out_edge_iterator out_edge_iterator; typedef in boost::detail::push_relabel
161 out_edge_iterator ei, e_end; in push_relabel()
181 out_edge_iterator a_iter, a_end; in push_relabel()
275 out_edge_iterator ai, a_end; in global_distance_update()
308 out_edge_iterator ai, ai_end; in discharge()
391 out_edge_iterator ai, a_end, min_edge_iter; in relabel_distance()
485 out_edge_iterator ai, a_end; in convert_preflow_to_flow()
664 out_edge_iterator ai, a_end; in is_flow()
735 out_edge_iterator ei, e_end; in print_flow_values()
762 std::vector< std::pair< out_edge_iterator, out_edge_iterator > >
[all …]
|
| D | iteration_macros.hpp | 144 typename boost::graph_traits< GraphType >::out_edge_iterator, \
145 typename boost::graph_traits< GraphType >::out_edge_iterator > \
157 for (std::pair< boost::graph_traits< GraphType >::out_edge_iterator, \
158 boost::graph_traits< GraphType >::out_edge_iterator > \
|
| D | undirected_graph.hpp | 80 typedef typename graph_type::out_edge_iterator out_edge_iterator; typedef in boost::undirected_graph
184 std::pair< out_edge_iterator, out_edge_iterator > p in clear_vertex()
230 out_edge_iterator i, i_end; in remove_edge()
403 inline std::pair< typename UNDIRECTED_GRAPH::out_edge_iterator,
404 typename UNDIRECTED_GRAPH::out_edge_iterator >
429 inline std::pair< typename UNDIRECTED_GRAPH::out_edge_iterator,
430 typename UNDIRECTED_GRAPH::out_edge_iterator >
|
| D | adjacency_matrix.hpp | 533 out_edge_iterator; typedef in boost::adjacency_matrix
543 out_edge_iterator >::type adjacency_iterator;
689 typename adjacency_matrix< directedS, VP, EP, GP, A >::out_edge_iterator,
690 typename adjacency_matrix< directedS, VP, EP, GP, A >::out_edge_iterator >
703 typedef typename Graph::out_edge_iterator out_edge_iterator; in out_edges() typedef
704 return std::make_pair(out_edge_iterator(pred, first, last), in out_edges()
705 out_edge_iterator(pred, last, last)); in out_edges()
711 typename adjacency_matrix< undirectedS, VP, EP, GP, A >::out_edge_iterator,
712 typename adjacency_matrix< undirectedS, VP, EP, GP, A >::out_edge_iterator >
728 typedef typename Graph::out_edge_iterator out_edge_iterator; in out_edges() typedef
[all …]
|
| D | boykov_kolmogorov_max_flow.hpp | 83 typedef typename tGraphTraits::out_edge_iterator out_edge_iterator; typedef in boost::detail::bk_max_flow
176 out_edge_iterator ei, e_end; in augment_direct_paths()
277 out_edge_iterator ei, e_end; in grow()
339 out_edge_iterator ei, e_end; in grow()
528 out_edge_iterator ei, e_end; in adopt()
594 out_edge_iterator ei, e_end; in adopt()
924 out_edge_iterator m_last_grow_edge_it;
925 out_edge_iterator m_last_grow_edge_end;
|
| D | graph_concepts.hpp | 78 typedef typename graph_traits< G >::out_edge_iterator out_edge_iterator; typedef
83 (boost::mpl::not_< boost::is_same< out_edge_iterator, void > >::value));
89 BOOST_CONCEPT_ASSERT((MultiPassInputIterator< out_edge_iterator >)); in BOOST_CONCEPT_USAGE()
111 std::pair< out_edge_iterator, out_edge_iterator > p;
323 typename boost::graph_traits< G >::out_edge_iterator iter;
|
| D | grid_graph.hpp | 311 out_edge_iterator; typedef in boost::grid_graph
827 friend inline std::pair< typename type::out_edge_iterator,
828 typename type::out_edge_iterator >
833 typedef typename type::out_edge_iterator out_edge_iterator; in out_edges() typedef
835 return (std::make_pair(out_edge_iterator(degree_iterator(0), in out_edges()
837 out_edge_iterator(degree_iterator(graph.out_degree(vertex)), in out_edges()
|
| D | graph_utility.hpp | 45 inline std::pair< typename graph_traits< Graph >::out_edge_iterator,
46 typename graph_traits< Graph >::out_edge_iterator >
170 typename graph_traits< IncidenceGraph >::out_edge_iterator ei, ei_end; in print_graph_dispatch()
184 typename graph_traits< IncidenceGraph >::out_edge_iterator ei, ei_end; in print_graph_dispatch()
244 typename graph_traits< Graph >::out_edge_iterator oi, oiend, out_found; in is_adj_dispatch()
267 typename graph_traits< Graph >::out_edge_iterator oi, oiend, out_found; in is_adj_dispatch()
444 typedef typename boost::graph_traits< Graph >::out_edge_iterator ei; in has_no_out_edges()
|
| D | reverse_graph.hpp | 176 out_edge_iterator; typedef in boost::reverse_graph
182 typename Traits::out_edge_iterator >
187 out_edge_iterator >::type adjacency_iterator;
311 typename reverse_graph< BidirectionalGraph >::out_edge_iterator,
312 typename reverse_graph< BidirectionalGraph >::out_edge_iterator >
390 typename graph_traits< Graph >::out_edge_iterator first, last; in adjacent_vertices()
|
| D | edge_connectivity.hpp | 77 typedef typename Traits::out_edge_iterator out_edge_iterator; in edge_connectivity() typedef
174 out_edge_iterator ei, ei_end; in edge_connectivity()
|
| D | labeled_graph.hpp | 316 typedef typename graph_traits< graph_type >::out_edge_iterator
317 out_edge_iterator; typedef in boost::labeled_graph
521 typedef typename graph_traits< graph_type >::out_edge_iterator
522 out_edge_iterator; typedef in boost::labeled_graph
678 inline std::pair< typename LABELED_GRAPH::out_edge_iterator,
679 typename LABELED_GRAPH::out_edge_iterator >
|
| /third_party/boost/boost/graph/detail/ |
| D | adjacency_list.hpp | 590 inline void remove_edge(typename Config::out_edge_iterator iter) in remove_edge()
650 typename Config::out_edge_iterator first, last; in remove_out_edge_if()
922 inline void remove_edge(typename Config::out_edge_iterator iter) in remove_edge()
980 typename Config::out_edge_iterator first, last; in remove_out_edge_if()
1049 typename Config::out_edge_iterator ei, ei_end; in clear_vertex()
1222 typedef typename Config::out_edge_iterator out_edge_iterator; typedef
1224 std::pair< out_edge_iterator, out_edge_iterator > get_parallel_edge_sublist( in get_parallel_edge_sublist()
1230 std::pair< out_edge_iterator, out_edge_iterator > get_parallel_edge_sublist( in get_parallel_edge_sublist()
1236 std::pair< out_edge_iterator, out_edge_iterator > get_parallel_edge_sublist( in get_parallel_edge_sublist()
1242 std::pair< out_edge_iterator, out_edge_iterator > get_parallel_edge_sublist( in get_parallel_edge_sublist()
[all …]
|
| /third_party/boost/boost/graph/distributed/ |
| D | depth_first_search.hpp | 36 typedef typename graph_traits<DistributedGraph>::out_edge_iterator
37 out_edge_iterator; typedef in boost::graph::distributed::detail::parallel_dfs
108 out_edge_iterator ei, ei_end; in run()
184 for (out_edge_iterator ei = next_out_edge[get(index_map, i)], in shift_center_of_activity()
227 std::vector<out_edge_iterator> next_out_edge;
|
| /third_party/boost/libs/graph/test/ |
| D | test_direction.hpp | 26 typedef typename graph_traits< Graph >::out_edge_iterator OutIter; in test_outdirected_graph()
115 typedef typename graph_traits< Graph >::out_edge_iterator OutIter; in test_undirected_graph()
|