| /third_party/boost/libs/graph/test/ |
| D | random_matching_test.cpp | 23 undirected_graph; typedef
25 typedef property_map< undirected_graph, vertex_index_t >::type
28 graph_traits< undirected_graph >::vertex_descriptor, vertex_index_map_t >
30 typedef graph_traits< undirected_graph >::vertex_iterator vertex_iterator_t;
31 typedef graph_traits< undirected_graph >::vertex_descriptor vertex_descriptor_t;
32 typedef graph_traits< undirected_graph >::vertices_size_type v_size_t;
48 undirected_graph g(n); in main()
84 typedef graph_traits< undirected_graph >::edge_iterator edge_iterator_t; in main()
93 if (mate[*vi] != graph_traits< undirected_graph >::null_vertex() in main()
102 if (mate[*vi] != graph_traits< undirected_graph >::null_vertex()) in main()
[all …]
|
| D | stoer_wagner_test.cpp | 28 undirected_graph; typedef
29 typedef boost::property_map< undirected_graph, boost::edge_weight_t >::type
63 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE()
85 undirected_graph g; in BOOST_AUTO_TEST_CASE()
93 typedef boost::graph_traits< undirected_graph >::vertex_descriptor in BOOST_AUTO_TEST_CASE()
98 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE()
123 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE()
147 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE()
215 typedef boost::graph_traits< undirected_graph >::vertex_descriptor in BOOST_AUTO_TEST_CASE()
220 undirected_graph g; in BOOST_AUTO_TEST_CASE()
[all …]
|
| D | mas_test.cpp | 30 undirected_graph; typedef
31 typedef boost::property_map< undirected_graph, boost::edge_weight_t >::type
116 typedef boost::graph_traits< undirected_graph >::vertex_descriptor in BOOST_AUTO_TEST_CASE()
118 typedef boost::graph_traits< undirected_graph >::edge_descriptor in BOOST_AUTO_TEST_CASE()
124 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE()
134 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE()
141 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE()
150 mas_edge_connectivity_visitor< undirected_graph, in BOOST_AUTO_TEST_CASE()
224 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE()
231 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE()
|
| D | labeled_graph.cpp | 93 typedef labeled_graph< undirected_graph<>, unsigned > Graph; in test_norm()
113 typedef undirected_graph<> Graph; in test_temp()
132 typedef labeled_graph< undirected_graph< Actor, Movie >, string > Graph; in test_bacon()
|
| D | matching_test.cpp | 32 undirected_graph; typedef
379 matching_test< undirected_graph >(10, "adjacency_list (using vectors)"); in main()
383 matching_test< undirected_graph >(20, "adjacency_list (using vectors)"); in main()
387 matching_test< undirected_graph >(21, "adjacency_list (using vectors)"); in main()
392 matching_test<undirected_graph>(50, "adjacency_list (using vectors)"); in main()
396 matching_test<undirected_graph>(51, "adjacency_list (using vectors)"); in main()
|
| D | index_graph.cpp | 92 test< undirected_graph<> >(); in main()
95 build< undirected_graph<> >(); in main()
|
| D | swap.cpp | 19 test_member_swap< boost::undirected_graph<> >(); in main()
|
| D | weighted_matching_test.cpp | 27 undirected_graph; typedef
155 make_graph< undirected_graph >(num_v, num_e, input_edges), answer); in main()
|
| D | bron_kerbosch_all_cliques.cpp | 69 typedef undirected_graph<> Graph; in main()
|
| D | tiernan_all_cycles.cpp | 66 typedef undirected_graph<> Graph; in main()
|
| D | cycle_test.hpp | 79 cycle_test_detail::test_one< boost::undirected_graph<> >(algorithm); in cycle_test()
|
| D | clustering_coefficient.cpp | 96 typedef undirected_graph<> Graph; in main()
|
| D | degree_centrality.cpp | 112 typedef undirected_graph<> Graph; in main()
|
| D | closeness_centrality.cpp | 122 typedef undirected_graph<> Graph; in main()
|
| /third_party/boost/libs/graph/example/ |
| D | stoer_wagner.cpp | 31 undirected_graph; in main() typedef
32 typedef boost::property_map< undirected_graph, boost::edge_weight_t >::type in main()
48 undirected_graph g(edges, edges + 16, ws, 8, 16); in main()
|
| D | bron_kerbosch_clique_number.cpp | 21 typedef undirected_graph<> Graph;
|
| D | undirected_graph.cpp | 13 typedef boost::undirected_graph< boost::no_property > Graph;
|
| D | bron_kerbosch_print_cliques.cpp | 45 typedef undirected_graph< Actor > Graph;
|
| D | degree_centrality.cpp | 27 typedef undirected_graph< Actor > Graph;
|
| D | clustering_coefficient.cpp | 26 typedef undirected_graph< Actor > Graph;
|
| D | closeness_centrality.cpp | 28 typedef undirected_graph< Actor > Graph;
|
| D | mean_geodesic.cpp | 27 typedef undirected_graph< Actor > Graph;
|
| D | eccentricity.cpp | 27 typedef undirected_graph< Actor > Graph;
|
| D | scaled_closeness_centrality.cpp | 54 typedef undirected_graph< Actor > Graph;
|
| /third_party/boost/boost/graph/ |
| D | undirected_graph.hpp | 36 class undirected_graph class
93 inline undirected_graph(GraphProp const& p = GraphProp()) in undirected_graph() function in boost::undirected_graph
102 inline undirected_graph(undirected_graph const& x) in undirected_graph() function in boost::undirected_graph
111 inline undirected_graph( in undirected_graph() function in boost::undirected_graph
123 inline undirected_graph(EdgeIterator f, EdgeIterator l, in undirected_graph() function in boost::undirected_graph
140 undirected_graph& operator=(undirected_graph const& g) in operator =()
334 void swap(undirected_graph& g) in swap()
378 #define UNDIRECTED_GRAPH undirected_graph< VP, EP, GP >
|