Searched refs:w_prime (Results 1 – 2 of 2) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | maximum_weighted_matching.hpp | 577 void make_blossom(blossom_ptr_t b, vertex_descriptor_t w_prime, in make_blossom() argument
583 w_prime, graph::detail::V_EVEN); in make_blossom()
770 vertex_descriptor_t w, vertex_descriptor_t w_prime, in blossoming() argument
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()
893 vertex_descriptor_t w_prime = base_vertex(w); in augment_matching() local
897 if (v_prime == w_prime) in augment_matching()
903 std::swap(v_prime, w_prime); in augment_matching()
[all …]
|
| 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()
|