| /dports/math/py-networkx/networkx-2.6.3/networkx/generators/ |
| H A D | joint_degree_seq.py | 112 w_prime = next(iter(unsat))
122 w_prime = next(iter_var)
138 h_node_residual[w_prime] -= 1
140 unsat.remove(w_prime)
399 w_prime = unsat.pop()
400 unsat.add(w_prime)
410 G.add_edge(w_prime, v)
423 return w_prime
453 w_prime = unsat.pop()
454 unsat.add(w_prime)
[all …]
|
| /dports/textproc/py-gensim/gensim-4.0.1/gensim/topic_coherence/ |
| H A D | segmentation.py | 48 for w_prime_index, w_prime in enumerate(top_words[1:]):
50 s_one_pre_t.append((w_prime, w_star))
87 for w_prime_index, w_prime in enumerate(top_words):
92 s_one_one_t.append((w_prime, w_star))
129 for w_prime in top_words:
130 s_one_set_t.append((w_prime, top_words))
|
| H A D | direct_confirmation_measure.py | 69 for w_prime, w_star in s_i:
72 co_occur_count = accumulator[w_prime, w_star]
190 for w_prime, w_star in s_i:
191 w_prime_count = accumulator[w_prime]
193 co_occur_count = accumulator[w_prime, w_star]
197 numerator = log_ratio_measure([[(w_prime, w_star)]], accumulator)[0]
|
| H A D | indirect_confirmation_measure.py | 95 for w_prime, w_star in topic_segments:
96 if not hasattr(w_prime, '__iter__'):
97 w_prime = [w_prime]
102 segment_sims.append(accumulator.ids_similarity(w_prime, w_star))
175 for i, (w_prime, w_star) in enumerate(topic_segments):
176 w_prime_cv = context_vectors[w_prime, topic_words]
|
| /dports/science/nwchem/nwchem-7b21660b82ebd85ef659f6fba7e1e73433b0bd0a/src/nwpw/nwpwlib/pseudopotential/paw_atom/ |
| H A D | paw_scattering.c | 30 static double **w_prime; variable
56 w_prime = paw_alloc_2d_array(nbasis,Ngrid); in paw_init_paw_scattering()
84 paw_dealloc_2d_array(nbasis,Ngrid,w_prime); in paw_end_paw_scattering()
160 paw_Zero_LogGrid(w_prime[i1]); in paw_solve_paw_scattering()
171 w_prime[i1] in paw_solve_paw_scattering()
279 psi_prime[k] = psi_prime[k] + c[i1]*w_prime[i1][k]; in paw_solve_paw_scattering()
|
| /dports/science/nwchem-data/nwchem-7.0.2-release/src/nwpw/nwpwlib/pseudopotential/paw_atom/ |
| H A D | paw_scattering.c | 30 static double **w_prime; variable
56 w_prime = paw_alloc_2d_array(nbasis,Ngrid); in paw_init_paw_scattering()
84 paw_dealloc_2d_array(nbasis,Ngrid,w_prime); in paw_end_paw_scattering()
160 paw_Zero_LogGrid(w_prime[i1]); in paw_solve_paw_scattering()
171 w_prime[i1] in paw_solve_paw_scattering()
279 psi_prime[k] = psi_prime[k] + c[i1]*w_prime[i1][k]; in paw_solve_paw_scattering()
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 698 label_T[w_prime] = v; in blossoming()
700 outlet[w_prime] = w; in blossoming()
703 make_blossom(b, w_prime, v_prime, nca); in blossoming()
704 make_blossom(b, v_prime, w_prime, nca); in blossoming()
795 vertex_descriptor_t w_prime = base_vertex(w); in augment_matching() local
798 if (v_prime == w_prime) in augment_matching()
804 std::swap(v_prime, w_prime); in augment_matching()
813 if (slack(current_edge) < pi[w_prime]) in augment_matching()
834 gamma[w_prime] = std::min(gamma[w_prime], slack(current_edge)); in augment_matching()
852 blossoming(v, v_prime, w, w_prime, nca); in augment_matching()
[all …]
|
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 583 w_prime, graph::detail::V_EVEN); in make_blossom()
786 label_T[w_prime] = v; in blossoming()
788 outlet[w_prime] = w; in blossoming()
791 make_blossom(b, w_prime, v_prime, nca); in blossoming()
792 make_blossom(b, v_prime, w_prime, nca); in blossoming()
897 if (v_prime == w_prime) in augment_matching()
903 std::swap(v_prime, w_prime); in augment_matching()
914 if (slack(current_edge) < pi[w_prime]) in augment_matching()
919 || label_T[w_prime] == v in augment_matching()
920 || label_T[w_prime] in augment_matching()
[all …]
|
| H A D | max_cardinality_matching.hpp | 240 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
247 std::swap(v_prime, w_prime); in augment_matching()
251 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
253 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
254 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
265 pred[w_prime] = v; in augment_matching()
270 else if (vertex_state[w_prime] == graph::detail::V_EVEN in augment_matching()
271 && w_prime != v_prime) in augment_matching()
273 vertex_descriptor_t w_up = w_prime; in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 583 w_prime, graph::detail::V_EVEN); in make_blossom()
786 label_T[w_prime] = v; in blossoming()
788 outlet[w_prime] = w; in blossoming()
791 make_blossom(b, w_prime, v_prime, nca); in blossoming()
792 make_blossom(b, v_prime, w_prime, nca); in blossoming()
897 if (v_prime == w_prime) in augment_matching()
903 std::swap(v_prime, w_prime); in augment_matching()
914 if (slack(current_edge) < pi[w_prime]) in augment_matching()
919 || label_T[w_prime] == v in augment_matching()
920 || label_T[w_prime] in augment_matching()
[all …]
|
| H A D | max_cardinality_matching.hpp | 240 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
247 std::swap(v_prime, w_prime); in augment_matching()
251 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
253 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
254 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
265 pred[w_prime] = v; in augment_matching()
270 else if (vertex_state[w_prime] == graph::detail::V_EVEN in augment_matching()
271 && w_prime != v_prime) in augment_matching()
273 vertex_descriptor_t w_up = w_prime; in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 583 w_prime, graph::detail::V_EVEN); in make_blossom()
786 label_T[w_prime] = v; in blossoming()
788 outlet[w_prime] = w; in blossoming()
791 make_blossom(b, w_prime, v_prime, nca); in blossoming()
792 make_blossom(b, v_prime, w_prime, nca); in blossoming()
897 if (v_prime == w_prime) in augment_matching()
903 std::swap(v_prime, w_prime); in augment_matching()
914 if (slack(current_edge) < pi[w_prime]) in augment_matching()
919 || label_T[w_prime] == v in augment_matching()
920 || label_T[w_prime] in augment_matching()
[all …]
|
| H A D | max_cardinality_matching.hpp | 240 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
247 std::swap(v_prime, w_prime); in augment_matching()
251 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
253 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
254 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
265 pred[w_prime] = v; in augment_matching()
270 else if (vertex_state[w_prime] == graph::detail::V_EVEN in augment_matching()
271 && w_prime != v_prime) in augment_matching()
273 vertex_descriptor_t w_up = w_prime; in augment_matching()
326 w_prime, nearest_common_ancestor, std::make_pair(w, v)); in augment_matching()
|
| /dports/devel/boost-libs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 698 label_T[w_prime] = v; in blossoming()
700 outlet[w_prime] = w; in blossoming()
703 make_blossom(b, w_prime, v_prime, nca); in blossoming()
704 make_blossom(b, v_prime, w_prime, nca); in blossoming()
795 vertex_descriptor_t w_prime = base_vertex(w); in augment_matching() local
798 if (v_prime == w_prime) in augment_matching()
804 std::swap(v_prime, w_prime); in augment_matching()
813 if (slack(current_edge) < pi[w_prime]) in augment_matching()
834 gamma[w_prime] = std::min(gamma[w_prime], slack(current_edge)); in augment_matching()
852 blossoming(v, v_prime, w, w_prime, nca); in augment_matching()
[all …]
|
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/devel/boost-python-libs/boost_1_72_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 698 label_T[w_prime] = v; in blossoming()
700 outlet[w_prime] = w; in blossoming()
703 make_blossom(b, w_prime, v_prime, nca); in blossoming()
704 make_blossom(b, v_prime, w_prime, nca); in blossoming()
795 vertex_descriptor_t w_prime = base_vertex(w); in augment_matching() local
798 if (v_prime == w_prime) in augment_matching()
804 std::swap(v_prime, w_prime); in augment_matching()
813 if (slack(current_edge) < pi[w_prime]) in augment_matching()
834 gamma[w_prime] = std::min(gamma[w_prime], slack(current_edge)); in augment_matching()
852 blossoming(v, v_prime, w, w_prime, nca); in augment_matching()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/ |
| H A D | maximum_weighted_matching.hpp | 583 w_prime, graph::detail::V_EVEN); in make_blossom()
786 label_T[w_prime] = v; in blossoming()
788 outlet[w_prime] = w; in blossoming()
791 make_blossom(b, w_prime, v_prime, nca); in blossoming()
792 make_blossom(b, v_prime, w_prime, nca); in blossoming()
897 if (v_prime == w_prime) in augment_matching()
903 std::swap(v_prime, w_prime); in augment_matching()
914 if (slack(current_edge) < pi[w_prime]) in augment_matching()
919 || label_T[w_prime] == v in augment_matching()
920 || label_T[w_prime] in augment_matching()
[all …]
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 248 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
255 std::swap(v_prime,w_prime); in augment_matching()
259 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
261 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
262 vertex_state[mate[w_prime]] = graph::detail::V_EVEN; in augment_matching()
264 for( boost::tie(ei,ei_end) = out_edges(mate[w_prime], g); ei != ei_end; ++ei) in augment_matching()
266 pred[w_prime] = v; in augment_matching()
271 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
273 vertex_descriptor_t w_up = w_prime; in augment_matching()
323 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/databases/percona57-client/boost_1_59_0/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|
| /dports/security/keybase/client-v5.7.1/shared/ios/Pods/boost-for-react-native/boost/graph/ |
| H A D | max_cardinality_matching.hpp | 252 vertex_descriptor_t w_prime = origin[ds.find_set(w)]; in augment_matching() local
259 std::swap(v_prime,w_prime); in augment_matching()
263 if (vertex_state[w_prime] == graph::detail::V_UNREACHED) in augment_matching()
265 vertex_state[w_prime] = graph::detail::V_ODD; in augment_matching()
266 vertex_descriptor_t w_prime_mate = mate[w_prime]; in augment_matching()
276 pred[w_prime] = v; in augment_matching()
281 else if (vertex_state[w_prime] == graph::detail::V_EVEN && w_prime != v_prime) in augment_matching()
283 vertex_descriptor_t w_up = w_prime; in augment_matching()
333 link_and_set_bridges(w_prime, nearest_common_ancestor, std::make_pair(w,v)); in augment_matching()
|