| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | isomorphism.hpp | 58 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
101 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
102 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
105 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
106 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
114 DFSNumMap dfs_num; member
187 dfs_num[*v] = n++; in test_isomorphism()
189 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
201 if (dfs_num[i] > dfs_num_k) { in match()
221 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/biology/lamarc/lamarc-2.1.8/boost/graph/ |
| H A D | isomorphism.hpp | 63 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
106 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
107 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
110 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
111 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
119 DFSNumMap dfs_num; member
192 dfs_num[*v] = n++; in test_isomorphism()
194 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
206 if (dfs_num[i] > dfs_num_k) { in match()
226 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | isomorphism.hpp | 64 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
120 : G1(G1), dfs_num(dfs_num) in edge_cmp()
126 int u1 = dfs_num[source(e1, G1)], v1 = dfs_num[target(e1, G1)]; in operator ()()
127 int u2 = dfs_num[source(e2, G1)], v2 = dfs_num[target(e2, G1)]; in operator ()()
135 DFSNumMap dfs_num; member
214 dfs_num = make_safe_iterator_property_map( in test_isomorphism()
224 dfs_num[*v] = n++; in test_isomorphism()
226 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
268 if (dfs_num[i] > dfs_num_k) in match()
300 else if (dfs_num[j] > dfs_num_k) in match()
[all …]
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | isomorphism.hpp | 64 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
120 : G1(G1), dfs_num(dfs_num) in edge_cmp()
126 int u1 = dfs_num[source(e1, G1)], v1 = dfs_num[target(e1, G1)]; in operator ()()
127 int u2 = dfs_num[source(e2, G1)], v2 = dfs_num[target(e2, G1)]; in operator ()()
135 DFSNumMap dfs_num; member
214 dfs_num = make_safe_iterator_property_map( in test_isomorphism()
224 dfs_num[*v] = n++; in test_isomorphism()
226 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
268 if (dfs_num[i] > dfs_num_k) in match()
300 else if (dfs_num[j] > dfs_num_k) in match()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | isomorphism.hpp | 64 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
120 : G1(G1), dfs_num(dfs_num) in edge_cmp()
126 int u1 = dfs_num[source(e1, G1)], v1 = dfs_num[target(e1, G1)]; in operator ()()
127 int u2 = dfs_num[source(e2, G1)], v2 = dfs_num[target(e2, G1)]; in operator ()()
135 DFSNumMap dfs_num; member
214 dfs_num = make_safe_iterator_property_map( in test_isomorphism()
224 dfs_num[*v] = n++; in test_isomorphism()
226 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
268 if (dfs_num[i] > dfs_num_k) in match()
300 else if (dfs_num[j] > dfs_num_k) in match()
[all …]
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | isomorphism.hpp | 64 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
120 : G1(G1), dfs_num(dfs_num) in edge_cmp()
126 int u1 = dfs_num[source(e1, G1)], v1 = dfs_num[target(e1, G1)]; in operator ()()
127 int u2 = dfs_num[source(e2, G1)], v2 = dfs_num[target(e2, G1)]; in operator ()()
135 DFSNumMap dfs_num; member
214 dfs_num = make_safe_iterator_property_map( in test_isomorphism()
224 dfs_num[*v] = n++; in test_isomorphism()
226 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
268 if (dfs_num[i] > dfs_num_k) in match()
300 else if (dfs_num[j] > dfs_num_k) in match()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/math/py-pystan/pystan-2.19.0.0/pystan/stan/lib/stan_math/lib/boost_1.69.0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/databases/mysql57-client/mysql-5.7.36/boost/boost_1_59_0/boost/graph/ |
| H A D | isomorphism.hpp | 60 DFSNumMap dfs_num; member in boost::detail::isomorphism_algo
103 edge_cmp(const Graph1& G1, DFSNumMap dfs_num) in edge_cmp()
104 : G1(G1), dfs_num(dfs_num) { } in edge_cmp()
107 int u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)]; in operator ()()
108 int u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)]; in operator ()()
116 DFSNumMap dfs_num; member
193 dfs_num[*v] = n++; in test_isomorphism()
195 sort(ordered_edges, edge_cmp(G1, dfs_num)); in test_isomorphism()
226 if (dfs_num[i] > dfs_num_k) { in match()
253 else if (dfs_num[j] > dfs_num_k) { in match()
[all …]
|
| /dports/math/z3/z3-z3-4.8.13/src/sat/ |
| H A D | sat_big.cpp | 132 int dfs_num = 0; in init_dfs_num() local
138 m_right[u.index()] = ++dfs_num; in init_dfs_num()
144 m_left[u.index()] = ++dfs_num; in init_dfs_num()
160 m_left[i] = ++dfs_num; in init_dfs_num()
161 m_right[i] = ++dfs_num; in init_dfs_num()
|
| /dports/math/py-z3-solver/z3-z3-4.8.10/src/sat/ |
| H A D | sat_big.cpp | 132 int dfs_num = 0; in init_dfs_num() local
138 m_right[u.index()] = ++dfs_num; in init_dfs_num()
144 m_left[u.index()] = ++dfs_num; in init_dfs_num()
160 m_left[i] = ++dfs_num; in init_dfs_num()
161 m_right[i] = ++dfs_num; in init_dfs_num()
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/doc/ |
| H A D | isomorphism-impl-v3.w | 296 if (dfs_num[i] > dfs_num_k) {
299 else if (dfs_num[j] > dfs_num_k) {
393 int next_k = std::max(dfs_num_k, std::max(dfs_num[i], dfs_num[j]));
683 // Create the dfs_num array and dfs_num_map
689 dfs_num[*v] = n++;
719 sort(ordered_edges, edge_cmp(G1, dfs_num));
728 : G1(G1), dfs_num(dfs_num) { }
731 vertex1_t u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)];
732 vertex1_t u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)];
740 DFSNumMap dfs_num;
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/doc/ |
| H A D | isomorphism-impl-v3.w | 296 if (dfs_num[i] > dfs_num_k) {
299 else if (dfs_num[j] > dfs_num_k) {
393 int next_k = std::max(dfs_num_k, std::max(dfs_num[i], dfs_num[j]));
683 // Create the dfs_num array and dfs_num_map
689 dfs_num[*v] = n++;
719 sort(ordered_edges, edge_cmp(G1, dfs_num));
728 : G1(G1), dfs_num(dfs_num) { }
731 vertex1_t u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)];
732 vertex1_t u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)];
740 DFSNumMap dfs_num;
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/doc/ |
| H A D | isomorphism-impl-v3.w | 296 if (dfs_num[i] > dfs_num_k) {
299 else if (dfs_num[j] > dfs_num_k) {
393 int next_k = std::max(dfs_num_k, std::max(dfs_num[i], dfs_num[j]));
683 // Create the dfs_num array and dfs_num_map
689 dfs_num[*v] = n++;
719 sort(ordered_edges, edge_cmp(G1, dfs_num));
728 : G1(G1), dfs_num(dfs_num) { }
731 vertex1_t u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)];
732 vertex1_t u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)];
740 DFSNumMap dfs_num;
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/doc/ |
| H A D | isomorphism-impl-v3.w | 296 if (dfs_num[i] > dfs_num_k) {
299 else if (dfs_num[j] > dfs_num_k) {
393 int next_k = std::max(dfs_num_k, std::max(dfs_num[i], dfs_num[j]));
683 // Create the dfs_num array and dfs_num_map
689 dfs_num[*v] = n++;
719 sort(ordered_edges, edge_cmp(G1, dfs_num));
728 : G1(G1), dfs_num(dfs_num) { }
731 vertex1_t u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)];
732 vertex1_t u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)];
740 DFSNumMap dfs_num;
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/doc/ |
| H A D | isomorphism-impl-v3.w | 296 if (dfs_num[i] > dfs_num_k) {
299 else if (dfs_num[j] > dfs_num_k) {
393 int next_k = std::max(dfs_num_k, std::max(dfs_num[i], dfs_num[j]));
683 // Create the dfs_num array and dfs_num_map
689 dfs_num[*v] = n++;
719 sort(ordered_edges, edge_cmp(G1, dfs_num));
728 : G1(G1), dfs_num(dfs_num) { }
731 vertex1_t u1 = dfs_num[source(e1,G1)], v1 = dfs_num[target(e1,G1)];
732 vertex1_t u2 = dfs_num[source(e2,G1)], v2 = dfs_num[target(e2,G1)];
740 DFSNumMap dfs_num;
[all …]
|