| /third_party/boost/libs/graph/test/ |
| D | dfs_cc.cpp | 44 typedef incidence_graph_archetype< vertex_t, undirected_tag, in main()
47 typedef vertex_list_graph_archetype< vertex_t, undirected_tag, in main()
|
| D | bfs_cc.cpp | 46 typedef incidence_graph_archetype< vertex_t, undirected_tag, in main()
49 typedef vertex_list_graph_archetype< vertex_t, undirected_tag, in main()
|
| D | betweenness_centrality_test.cpp | 249 = is_same< directed_category, undirected_tag >::value in randomly_add_edges()
380 = is_same< directed_category, undirected_tag >::value; in simple_unweighted_betweenness_centrality()
|
| D | floyd_warshall_test.cpp | 112 boost::undirected_tag >::value; in acceptance_test()
308 boost::undirected_tag >::value; in acceptance_test2()
|
| D | adjacency_matrix_test.cpp | 232 boost::undirected_tag* >::value in run_test()
235 boost::undirected_tag* >::value) in run_test()
|
| /third_party/boost/boost/graph/ |
| D | mesh_graph_generator.hpp | 30 = (is_base_and_derived< undirected_tag, directed_category >::value
31 || is_same< undirected_tag, directed_category >::value));
|
| D | erdos_renyi_generator.hpp | 44 = (is_base_of< undirected_tag, directed_category >::value));
118 = (is_base_of< undirected_tag, directed_category >::value));
|
| D | clustering_coefficient.hpp | 31 const Graph& g, size_t k, undirected_tag) in possible_edges() argument
53 typename graph_traits< Graph >::vertex_descriptor v, undirected_tag) in count_edges() argument
|
| D | graph_traits.hpp | 92 struct undirected_tag struct
102 inline bool is_directed(undirected_tag) { return false; } in is_directed() argument
|
| D | connected_components.hpp | 78 BOOST_STATIC_ASSERT((boost::is_same< directed, undirected_tag >::value)); in connected_components()
|
| D | relax.hpp | 48 bool is_undirected = is_same< DirCat, undirected_tag >::value; in relax()
|
| D | rmat_graph_generator.hpp | 422 if (u > v && is_same< directed_category, undirected_tag >::value) in unique_rmat_iterator()
581 && is_same< directed_category, undirected_tag >::value) in sorted_unique_rmat_iterator()
|
| D | graph_utility.hpp | 177 void print_graph_dispatch(const IncidenceGraph& G, Name name, undirected_tag, in print_graph_dispatch() argument
276 bool is_adj_dispatch(Graph& g, Vertex a, Vertex b, undirected_tag) in is_adj_dispatch() argument
|
| D | stoer_wagner_min_cut.hpp | 220 boost::undirected_tag >)); in stoer_wagner_min_cut()
|
| D | johnson_all_pairs_shortest.hpp | 50 bool is_undirected = is_same< DirCat, undirected_tag >::value; in johnson_all_pairs_shortest_paths()
|
| D | floyd_warshall_shortest.hpp | 125 undirected_tag >::value; in floyd_warshall_all_pairs_shortest_paths()
|
| D | tiernan_all_cycles.hpp | 307 template <> struct min_cycles< undirected_tag >
|
| D | adjacency_list.hpp | 225 undirected_tag >::type >::type directed_category;
|
| D | maximum_adjacency_search.hpp | 227 boost::undirected_tag >)); in maximum_adjacency_search()
|
| /third_party/boost/boost/graph/distributed/ |
| D | graphviz.hpp | 117 = (is_base_and_derived<undirected_tag, directed_category>::value in write_graphviz()
118 || is_same<undirected_tag, directed_category>::value); in write_graphviz()
|
| D | rmat_graph_generator.hpp | 84 if (u > v && is_same<directed_category, undirected_tag>::value) in scalable_rmat_iterator()
|
| D | crauser_et_al_shortest_paths.hpp | 494 Compare, undirected_tag, bidirectional_graph_tag) in initialize_min_in_weights() argument
564 is_same<directed_category, undirected_tag>::value; in crauser_et_al_shortest_paths()
|
| D | depth_first_search.hpp | 243 (is_convertible<directed_category, undirected_tag>::value)); in tsin_depth_first_visit()
|
| /third_party/boost/libs/graph/example/ |
| D | graph-assoc-types.cpp | 48 template < typename Graph > void foo_dispatch(Graph& g, boost::undirected_tag) in foo_dispatch() argument
|
| D | implicit_graph.cpp | 125 typedef boost::undirected_tag directed_category;
|