Home
last modified time | relevance | path

Searched refs:directed_category (Results 1 – 25 of 58) sorted by relevance

123

/third_party/boost/boost/graph/
Derdos_renyi_generator.hpp37 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::erdos_renyi_iterator
44 = (is_base_of< undirected_tag, directed_category >::value));
111 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::sorted_erdos_renyi_iterator
118 = (is_base_of< undirected_tag, directed_category >::value));
Drmat_graph_generator.hpp145 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::rmat_iterator
264 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::sorted_rmat_iterator
378 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::unique_rmat_iterator
422 if (u > v && is_same< directed_category, undirected_tag >::value) in unique_rmat_iterator()
500 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::sorted_unique_rmat_iterator
581 && is_same< directed_category, undirected_tag >::value) in sorted_unique_rmat_iterator()
Dmesh_graph_generator.hpp24 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::mesh_iterator
30 = (is_base_and_derived< undirected_tag, directed_category >::value
31 || is_same< undirected_tag, directed_category >::value));
Dgraph_traits.hpp69 typedef typename G::directed_category directed_category; typedef
108 typedef typename graph_traits< Graph >::directed_category Cat; in is_directed()
132 typename graph_traits< Graph >::directed_category >
Dgraphml.hpp90 typename graph_traits< MutableGraph >::directed_category, in is_directed()
258 typedef typename graph_traits< Graph >::directed_category directed_category; in write_graphml() typedef
266 = (is_convertible< directed_category*, directed_tag* >::value)); in write_graphml()
Dvertex_and_edge_range.hpp27 typedef typename traits_type::directed_category directed_category; typedef in boost::graph::vertex_and_edge_range
Dssca_graph_generator.hpp37 typedef typename graph_traits< Graph >::directed_category directed_category; typedef in boost::ssca_iterator
Dgraph_archetypes.hpp56 typedef Directed directed_category; typedef
114 typedef Directed directed_category; typedef
170 typedef Directed directed_category; typedef
Dclustering_coefficient.hpp65 typedef typename graph_traits< Graph >::directed_category Directed; in num_paths_through_vertex()
85 typedef typename graph_traits< Graph >::directed_category Directed; in num_triangles_on_vertex()
Dbron_kerbosch_all_cliques.hpp135 typename graph_traits< Graph >::directed_category) in is_connected_to_clique()
152 typename graph_traits< Graph >::directed_category cat; in filter_unconnected_vertices()
Dcompressed_sparse_row_graph.hpp254 typedef directed_tag directed_category; typedef in boost::compressed_sparse_row_graph
592 if (is_same< typename graph_traits< Graph >::directed_category, in compressed_sparse_row_graph()
608 if (is_same< typename graph_traits< Graph >::directed_category, in compressed_sparse_row_graph()
634 if (is_same< typename graph_traits< Graph >::directed_category, in assign()
649 if (is_same< typename graph_traits< Graph >::directed_category, in assign()
852 typedef bidirectional_tag directed_category; typedef in boost::compressed_sparse_row_graph
1001 if (is_same< typename graph_traits< Graph >::directed_category, in compressed_sparse_row_graph()
1017 if (is_same< typename graph_traits< Graph >::directed_category, in compressed_sparse_row_graph()
1044 if (is_same< typename graph_traits< Graph >::directed_category, in assign()
1060 if (is_same< typename graph_traits< Graph >::directed_category, in assign()
Dplod_generator.hpp252 is_convertible< typename graph_traits< Graph >::directed_category,
258 is_convertible< typename graph_traits< Graph >::directed_category,
Dtiernan_all_cycles.hpp333 typedef typename graph_traits< Graph >::directed_category Dir; in tiernan_all_cycles()
340 typedef typename graph_traits< Graph >::directed_category Dir; in tiernan_all_cycles()
Dconnected_components.hpp77 typedef typename boost::graph_traits< Graph >::directed_category directed; in connected_components()
Dgraphviz.hpp41 template < typename directed_category > struct graphviz_io_traits
267 typedef typename graph_traits< Graph >::directed_category cat_type; in write_graphviz()
344 typedef typename graph_traits< Graph >::directed_category cat_type; in write_graphviz_subgraph()
783 MutableGraph >::directed_category, in is_directed()
908 typename boost::graph_traits< CSRGraph >::directed_category, in is_directed()
Dlabeled_graph.hpp309 typedef typename graph_traits< graph_type >::directed_category
310 directed_category; typedef in boost::labeled_graph
514 typedef typename graph_traits< graph_type >::directed_category
515 directed_category; typedef in boost::labeled_graph
Dadjacency_list.hpp225 undirected_tag >::type >::type directed_category; typedef
234 typedef detail::edge_desc_impl< directed_category, vertex_descriptor >
Dbetweenness_centrality.hpp383 typedef typename graph_traits< Graph >::directed_category in brandes_betweenness_centrality_impl()
384 directed_category; in brandes_betweenness_centrality_impl() typedef
386 = is_convertible< directed_category*, undirected_tag* >::value; in brandes_betweenness_centrality_impl()
/third_party/boost/boost/graph/distributed/
Drmat_graph_generator.hpp32 typedef typename graph_traits<Graph>::directed_category directed_category; typedef in boost::scalable_rmat_iterator
84 if (u > v && is_same<directed_category, undirected_tag>::value) in scalable_rmat_iterator()
Dgraphviz.hpp108 typedef typename graph_traits<Graph>::directed_category directed_category; in write_graphviz() typedef
117 = (is_base_and_derived<undirected_tag, directed_category>::value in write_graphviz()
118 || is_same<undirected_tag, directed_category>::value); in write_graphviz()
Ddepth_first_search.hpp240 typedef typename graph_traits<DistributedGraph>::directed_category in tsin_depth_first_visit()
241 directed_category; in tsin_depth_first_visit() typedef
243 (is_convertible<directed_category, undirected_tag>::value)); in tsin_depth_first_visit()
Dcrauser_et_al_shortest_paths.hpp561 typedef typename graph_traits<DistributedGraph>::directed_category in crauser_et_al_shortest_paths()
562 directed_category; in crauser_et_al_shortest_paths() typedef
564 is_same<directed_category, undirected_tag>::value; in crauser_et_al_shortest_paths()
572 directed_category(), category()); in crauser_et_al_shortest_paths()
/third_party/boost/libs/graph/test/
Dbetweenness_centrality_test.cpp237 typedef typename graph_traits< MutableGraph >::directed_category in randomly_add_edges()
238 directed_category; in randomly_add_edges() typedef
249 = is_same< directed_category, undirected_tag >::value in randomly_add_edges()
378 typedef typename graph_traits< Graph >::directed_category directed_category; in simple_unweighted_betweenness_centrality() typedef
380 = is_same< directed_category, undirected_tag >::value; in simple_unweighted_betweenness_centrality()
/third_party/boost/libs/graph/example/
Dgraph-assoc-types.cpp19 typedef typename graph_traits< Graph >::directed_category Dir; in generic_foo()
55 typedef typename boost::graph_traits< Graph >::directed_category Cat; in foo()
/third_party/boost/boost/graph/detail/
Dadjacency_list.hpp80 typedef directed_tag directed_category; typedef
85 typedef directed_tag directed_category; typedef
89 typedef undirected_tag directed_category; typedef
93 typedef bidirectional_tag directed_category; typedef
1548 typedef typename Config::directed_category directed_category; typedef
2100 typedef typename Config::directed_category directed_category; typedef in boost::vec_adj_list_impl
2273 typedef typename Config::directed_category Cat; in remove_vertex()
2320 typedef typename Traits::directed_category directed_category; typedef
2762 typename Graph::directed_category, value_type, reference,
2766 typename Graph::directed_category, value_type, const_reference,
[all …]

123