| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
137 std::back_inserter(non_neighbor_S)); in edge_connectivity()
139 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
140 k = non_neighbor_S.front(); in edge_connectivity()
155 non_neighbor_S.clear(); in edge_connectivity()
158 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 100 std::vector< vertex_descriptor > S_star, non_neighbor_S; in edge_connectivity() local
139 std::back_inserter(non_neighbor_S)); in edge_connectivity()
141 while (!non_neighbor_S.empty()) in edge_connectivity()
143 k = non_neighbor_S.front(); in edge_connectivity()
159 non_neighbor_S.clear(); in edge_connectivity()
162 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | edge_connectivity.hpp | 100 std::vector< vertex_descriptor > S_star, non_neighbor_S; in edge_connectivity() local
139 std::back_inserter(non_neighbor_S)); in edge_connectivity()
141 while (!non_neighbor_S.empty()) in edge_connectivity()
143 k = non_neighbor_S.front(); in edge_connectivity()
159 non_neighbor_S.clear(); in edge_connectivity()
162 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | edge_connectivity.hpp | 100 std::vector< vertex_descriptor > S_star, non_neighbor_S; in edge_connectivity() local
139 std::back_inserter(non_neighbor_S)); in edge_connectivity()
141 while (!non_neighbor_S.empty()) in edge_connectivity()
143 k = non_neighbor_S.front(); in edge_connectivity()
159 non_neighbor_S.clear(); in edge_connectivity()
162 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | edge_connectivity.hpp | 100 std::vector< vertex_descriptor > S_star, non_neighbor_S;
139 std::back_inserter(non_neighbor_S));
141 while (!non_neighbor_S.empty())
143 k = non_neighbor_S.front(); in find_free_in_fan()
159 non_neighbor_S.clear();
162 std::back_inserter(non_neighbor_S));
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | edge_connectivity.hpp | 99 std::vector<vertex_descriptor> S_star, non_neighbor_S; in edge_connectivity() local
138 std::back_inserter(non_neighbor_S)); in edge_connectivity()
140 while (!non_neighbor_S.empty()) { // at most n - 1 times in edge_connectivity()
141 k = non_neighbor_S.front(); in edge_connectivity()
156 non_neighbor_S.clear(); in edge_connectivity()
160 std::back_inserter(non_neighbor_S)); in edge_connectivity()
|