Home
last modified time | relevance | path

Searched refs:traversal_category (Results 1 – 25 of 42) sorted by relevance

12

/third_party/boost/boost/graph/distributed/
Dconcepts.hpp43 typedef typename graph_traits<G>::traversal_category
44 traversal_category; typedef
48 BOOST_CONCEPT_ASSERT(( ConvertibleConcept<traversal_category, in constraints()
89 typedef typename graph_traits<G>::traversal_category
90 traversal_category; typedef
97 BOOST_CONCEPT_ASSERT(( ConvertibleConcept<traversal_category, in constraints()
125 typedef typename graph_traits<G>::traversal_category
126 traversal_category;
129 BOOST_CONCEPT_ASSERT((Convertible<traversal_category,
170 typedef typename graph_traits<G>::traversal_category
[all …]
Ddehne_gotz_min_spanning_tree.hpp548 typedef typename graph_traits<Graph>::traversal_category traversal_category; in dense_boruvka_minimum_spanning_tree() typedef
550 BOOST_STATIC_ASSERT((is_convertible<traversal_category*, in dense_boruvka_minimum_spanning_tree()
640 typedef typename graph_traits<Graph>::traversal_category traversal_category; in merge_local_minimum_spanning_trees() typedef
642 BOOST_STATIC_ASSERT((is_convertible<traversal_category*, in merge_local_minimum_spanning_trees()
705 typedef typename graph_traits<Graph>::traversal_category traversal_category; in boruvka_then_merge() typedef
707 BOOST_STATIC_ASSERT((is_convertible<traversal_category*, in boruvka_then_merge()
822 typedef typename graph_traits<Graph>::traversal_category traversal_category; in boruvka_mixed_merge() typedef
824 BOOST_STATIC_ASSERT((is_convertible<traversal_category*, in boruvka_mixed_merge()
Dlocal_subgraph.hpp93 typedef typename graph_traits<DistributedGraph>::traversal_category
97 struct traversal_category : struct in boost::local_subgraph
Dvertex_list_adaptor.hpp128 typedef typename inherited::traversal_category base_traversal_category;
136 struct traversal_category struct in boost::graph::vertex_list_adaptor
/third_party/boost/boost/iterator/
Diterator_concepts.hpp112 typedef typename boost::iterator_traversal<Iterator>::type traversal_category;
116 traversal_category
136 BOOST_DEDUCED_TYPENAME SinglePassIterator::traversal_category
152 BOOST_DEDUCED_TYPENAME ForwardTraversal::traversal_category
162 BOOST_DEDUCED_TYPENAME BidirectionalTraversal::traversal_category
180 BOOST_DEDUCED_TYPENAME RandomAccessTraversal::traversal_category
249 typedef typename boost::iterators::pure_iterator_traversal<Iterator>::type traversal_category;
259 … detail::interop_rand_access_constraints(i, ci, traversal_category(), const_traversal_category());
Dzip_iterator.hpp186 >::type traversal_category; typedef
194 traversal_category,
/third_party/boost/boost/graph/
Dgraph_concepts.hpp64 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
80 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
94 (Convertible< traversal_category, incidence_graph_tag >)); in BOOST_CONCEPT_USAGE()
121 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
127 (Convertible< traversal_category, bidirectional_graph_tag >)); in BOOST_CONCEPT_USAGE()
155 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
161 (Convertible< traversal_category, adjacency_graph_tag >)); in BOOST_CONCEPT_USAGE()
180 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
186 (Convertible< traversal_category, vertex_list_graph_tag >)); in BOOST_CONCEPT_USAGE()
231 typedef typename graph_traits< G >::traversal_category traversal_category; typedef
[all …]
Dgraph_traits.hpp71 typedef typename G::traversal_category traversal_category; typedef
221 is_convertible< typename graph_traits< Graph >::traversal_category,
229 is_convertible< typename graph_traits< Graph >::traversal_category,
237 is_convertible< typename graph_traits< Graph >::traversal_category,
245 is_convertible< typename graph_traits< Graph >::traversal_category,
253 is_convertible< typename graph_traits< Graph >::traversal_category,
Dgraph_archetypes.hpp25 struct traversal_category struct
36 typedef typename Base::traversal_category base_trav_cat;
37 struct traversal_category : public incidence_graph_tag, public base_trav_cat struct
103 typedef typename Base::traversal_category base_trav_cat;
104 struct traversal_category : public adjacency_graph_tag, public base_trav_cat struct
152 typedef typename Base::traversal_category base_trav_cat;
153 struct traversal_category : public vertex_list_graph_tag, struct
Doverloading.hpp40 typename graph_traits< Graph >::traversal_category >::value), \
Dlabeled_graph.hpp313 typedef typename graph_traits< graph_type >::traversal_category
314 traversal_category; typedef in boost::labeled_graph
518 typedef typename graph_traits< graph_type >::traversal_category
519 traversal_category; typedef in boost::labeled_graph
Dreverse_graph.hpp170 typedef typename Traits::traversal_category traversal_category; typedef in boost::reverse_graph
196 = is_convertible< traversal_category, edge_list_graph_tag >::value
Dvertex_and_edge_range.hpp30 struct traversal_category : public virtual vertex_list_graph_tag, struct in boost::graph::vertex_and_edge_range
Dbreadth_first_search.hpp296 VertexListGraph >::traversal_category >::value >()); in apply()
319 VertexListGraph >::traversal_category >::value >()); in apply()
Dpage_rank.hpp98 typedef typename graph_traits< Graph >::traversal_category category; in page_rank()
Dstanford_graph.hpp101 typedef sgb_traversal_tag traversal_category; typedef
119 typedef sgb_traversal_tag traversal_category; typedef
Ddijkstra_shortest_paths.hpp264 typename boost::graph_traits< Graph >::traversal_category >
312 typename boost::graph_traits< Graph >::traversal_category >
Dundirected_graph.hpp88 typedef typename graph_type::traversal_category traversal_category; typedef in boost::undirected_graph
Ddirected_graph.hpp88 typedef typename graph_type::traversal_category traversal_category; typedef in boost::directed_graph
Dfiltered_graph.hpp182 typedef typename Traits::traversal_category traversal_category; typedef in boost::filtered_graph
/third_party/boost/boost/range/
Dconcepts.hpp128 typedef BOOST_DEDUCED_TYPENAME iterator_traversal<Iterator>::type traversal_category; typedef
132 traversal_category,
154 BOOST_DEDUCED_TYPENAME SinglePassIteratorConcept::traversal_category,
193 BOOST_DEDUCED_TYPENAME ForwardIteratorConcept::traversal_category,
220 BOOST_DEDUCED_TYPENAME BidirectionalIteratorConcept::traversal_category,
241 BOOST_DEDUCED_TYPENAME RandomAccessIteratorConcept::traversal_category,
/third_party/boost/libs/parameter/test/literate/
Dpredicate-requirements0.cpp46 typename boost::graph_traits<T>::traversal_category
51 typename boost::graph_traits<T>::traversal_category
/third_party/boost/libs/iterator/doc/
Dissues.rst90 4. Change the specification of ``traversal_category`` to::
150 4. The changes to the specification of ``traversal_category`` are a
/third_party/boost/boost/mpi/
Dgraph_communicator.hpp528 struct traversal_category struct
/third_party/boost/libs/graph/example/
Dknights_tour.cpp74 typedef adjacency_graph_tag traversal_category; typedef

12