/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 27 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 55 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 76 undirected_graph g; in BOOST_AUTO_TEST_CASE() 81 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 85 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 107 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 129 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 189 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 192 undirected_graph g; in BOOST_AUTO_TEST_CASE() 216 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | mas_test.cpp | 28 …st::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph; typedef 29 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 103 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 104 typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor; in BOOST_AUTO_TEST_CASE() 109 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 116 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 119 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE() 123 …mas_edge_connectivity_visitor<undirected_graph,boost::d_ary_heap_indirect<vertex_descriptor, 22, i… in BOOST_AUTO_TEST_CASE() 193 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 196 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE()
|
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 27 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 55 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 76 undirected_graph g; in BOOST_AUTO_TEST_CASE() 81 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 85 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 107 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 129 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 189 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 192 undirected_graph g; in BOOST_AUTO_TEST_CASE() 216 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | mas_test.cpp | 28 …st::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph; typedef 29 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 103 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 104 typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor; in BOOST_AUTO_TEST_CASE() 109 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 116 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 119 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE() 123 …mas_edge_connectivity_visitor<undirected_graph,boost::d_ary_heap_indirect<vertex_descriptor, 22, i… in BOOST_AUTO_TEST_CASE() 193 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 196 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE()
|
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 23 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 51 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 72 undirected_graph g; in BOOST_AUTO_TEST_CASE() 77 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 81 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 103 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 125 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 185 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 188 undirected_graph g; in BOOST_AUTO_TEST_CASE() 212 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | mas_test.cpp | 28 …st::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph; typedef 29 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 103 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 104 typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor; in BOOST_AUTO_TEST_CASE() 109 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 116 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 119 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE() 123 …mas_edge_connectivity_visitor<undirected_graph,boost::d_ary_heap_indirect<vertex_descriptor, 22, i… in BOOST_AUTO_TEST_CASE() 193 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 196 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE()
|
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 23 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 51 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 72 undirected_graph g; in BOOST_AUTO_TEST_CASE() 77 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 81 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 103 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 125 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 185 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 188 undirected_graph g; in BOOST_AUTO_TEST_CASE() 212 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | mas_test.cpp | 28 …st::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph; typedef 29 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 103 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 104 typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor; in BOOST_AUTO_TEST_CASE() 109 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 116 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 119 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE() 123 …mas_edge_connectivity_visitor<undirected_graph,boost::d_ary_heap_indirect<vertex_descriptor, 22, i… in BOOST_AUTO_TEST_CASE() 193 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 196 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE()
|
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 23 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 51 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 72 undirected_graph g; in BOOST_AUTO_TEST_CASE() 77 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 81 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 103 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 125 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 185 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 188 undirected_graph g; in BOOST_AUTO_TEST_CASE() 212 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 23 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 51 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 72 undirected_graph g; in BOOST_AUTO_TEST_CASE() 77 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 81 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 103 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 125 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 185 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 188 undirected_graph g; in BOOST_AUTO_TEST_CASE() 212 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 27 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 55 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 76 undirected_graph g; in BOOST_AUTO_TEST_CASE() 81 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 85 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 107 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 129 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 189 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 192 undirected_graph g; in BOOST_AUTO_TEST_CASE() 216 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
H A D | random_matching_test.cpp | 24 property<vertex_index_t, int> > undirected_graph; typedef 26 typedef property_map<undirected_graph,vertex_index_t>::type vertex_index_map_t; 28 typedef graph_traits<undirected_graph>::vertex_iterator vertex_iterator_t; 29 typedef graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor_t; 30 typedef graph_traits<undirected_graph>::vertices_size_type v_size_t; 45 undirected_graph g(n); in main() 89 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex() && in main() 98 if (mate[*vi] != graph_traits<undirected_graph>::null_vertex()) in main() 101 mate[mate[*vi]] = graph_traits<undirected_graph>::null_vertex(); in main() 102 mate[*vi] = graph_traits<undirected_graph>::null_vertex(); in main() [all …]
|
H A D | stoer_wagner_test.cpp | 23 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 51 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 72 undirected_graph g; in BOOST_AUTO_TEST_CASE() 77 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 81 undirected_graph g(edges, edges + 4, ws, 3, 4); in BOOST_AUTO_TEST_CASE() 103 undirected_graph g(edges, edges + 9, ws, 7, 9); in BOOST_AUTO_TEST_CASE() 125 undirected_graph g(edges, edges + 16, ws, 8, 16); in BOOST_AUTO_TEST_CASE() 185 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 188 undirected_graph g; in BOOST_AUTO_TEST_CASE() 212 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
H A D | mas_test.cpp | 28 …st::undirectedS, boost::no_property, boost::property<boost::edge_weight_t, int> > undirected_graph; typedef 29 typedef boost::property_map<undirected_graph, boost::edge_weight_t>::type weight_map_type; 103 typedef boost::graph_traits<undirected_graph>::vertex_descriptor vertex_descriptor; in BOOST_AUTO_TEST_CASE() 104 typedef boost::graph_traits<undirected_graph>::edge_descriptor edge_descriptor; in BOOST_AUTO_TEST_CASE() 109 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 116 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 119 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE() 123 …mas_edge_connectivity_visitor<undirected_graph,boost::d_ary_heap_indirect<vertex_descriptor, 22, i… in BOOST_AUTO_TEST_CASE() 193 …typedef boost::shared_array_property_map<weight_type, boost::property_map<undirected_graph, boost:… in BOOST_AUTO_TEST_CASE() 196 …typedef boost::shared_array_property_map<index_in_heap_type, boost::property_map<undirected_graph,… in BOOST_AUTO_TEST_CASE()
|
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
H A 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; 32 typedef graph_traits< undirected_graph >::vertices_size_type v_size_t; 48 undirected_graph g(n); in main() 102 if (mate[*vi] != graph_traits< undirected_graph >::null_vertex()) in main() 105 mate[mate[*vi]] = graph_traits< undirected_graph >::null_vertex(); in main() 106 mate[*vi] = graph_traits< undirected_graph >::null_vertex(); in main() 111 = maximum_cardinality_matching_verifier< undirected_graph, mate_t, in main() [all …]
|
H A D | stoer_wagner_test.cpp | 28 undirected_graph; typedef 63 undirected_graph g(edges, edges + 12, ws, 8, 12); in BOOST_AUTO_TEST_CASE() 85 undirected_graph g; 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() 220 undirected_graph g; in BOOST_AUTO_TEST_CASE() 232 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE() 239 boost::property_map< undirected_graph, in BOOST_AUTO_TEST_CASE() 261 undirected_graph g; in BOOST_AUTO_TEST_CASE() [all …]
|
/dports/devel/hyperscan/hyperscan-5.4.0/src/util/ |
H A D | graph_undirected.h | 60 class undirected_graph; variable 86 friend class ::ue2::undirected_graph; 118 class undirected_graph { 127 explicit undirected_graph(GraphRef g_in) : g(g_in) {} in undirected_graph() function 312 vertices(const undirected_graph &ug) { in vertices() 317 edges(const undirected_graph &ug) { in edges() 379 const undirected_graph &ug) { in inv_adjacent_vertices() 414 get(Property p, undirected_graph &ug) { in get() 420 get(Property p, const undirected_graph &ug) { in get() 455 undirected_graph<BidirectionalGraph> [all …]
|
/dports/math/R-cran-igraph/igraph/tests/testthat/ |
H A D | test-make.R | 7 g1 <- make_(undirected_graph(1:10)) 8 g2 <- make_(undirected_graph(), 1:10) 9 g3 <- make_(1:10, undirected_graph()) 20 g1 <- sample_(undirected_graph(1:10)) 21 g2 <- sample_(undirected_graph(), 1:10) 22 g3 <- sample_(1:10, undirected_graph()) 28 g4 <- graph_(undirected_graph(1:10)) 29 g5 <- graph_(undirected_graph(), 1:10) 30 g6 <- graph_(1:10, undirected_graph())
|