Home
last modified time | relevance | path

Searched refs:blossom_iterator_t (Results 1 – 7 of 7) sorted by relevance

/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp100 for (blossom_iterator_t bi = sub_blossoms.begin(); bi != sub_blossoms.end(); ++bi) in set_base()
147 typedef typename std::vector<blossom_ptr_t>::iterator blossom_iterator_t; typedef in boost::weighted_augmenting_path_finder
242 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in add_sub_blossom()
328 … blossom_iterator_t expand_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_blossom()
331 for (blossom_iterator_t i = b->sub_blossoms.begin(); i != b->sub_blossoms.end(); ++i) in expand_blossom()
350 … blossom_iterator_t expand_T_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_T_blossom()
357 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
669 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end();) in augmenting()
881 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
912 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dmaximum_weighted_matching.hpp114 for (blossom_iterator_t bi = sub_blossoms.begin(); in set_base()
274 for (blossom_iterator_t bi = top_blossoms.begin(); in add_sub_blossom()
372 blossom_iterator_t expand_blossom( in expand_blossom()
376 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_blossom()
399 blossom_iterator_t expand_T_blossom( in expand_T_blossom()
408 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
410 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_T_blossom()
755 for (blossom_iterator_t bi = top_blossoms.begin(); in augmenting()
997 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
1031 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dmaximum_weighted_matching.hpp114 for (blossom_iterator_t bi = sub_blossoms.begin(); in set_base()
274 for (blossom_iterator_t bi = top_blossoms.begin(); in add_sub_blossom()
372 blossom_iterator_t expand_blossom( in expand_blossom()
376 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_blossom()
399 blossom_iterator_t expand_T_blossom( in expand_T_blossom()
408 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
410 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_T_blossom()
755 for (blossom_iterator_t bi = top_blossoms.begin(); in augmenting()
997 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
1031 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dmaximum_weighted_matching.hpp114 for (blossom_iterator_t bi = sub_blossoms.begin(); in set_base()
274 for (blossom_iterator_t bi = top_blossoms.begin(); in add_sub_blossom()
372 blossom_iterator_t expand_blossom( in expand_blossom()
376 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_blossom()
399 blossom_iterator_t expand_T_blossom( in expand_T_blossom()
408 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
410 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_T_blossom()
755 for (blossom_iterator_t bi = top_blossoms.begin(); in augmenting()
997 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
1031 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp100 for (blossom_iterator_t bi = sub_blossoms.begin(); bi != sub_blossoms.end(); ++bi) in set_base()
147 typedef typename std::vector<blossom_ptr_t>::iterator blossom_iterator_t; typedef in boost::weighted_augmenting_path_finder
242 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in add_sub_blossom()
328 … blossom_iterator_t expand_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_blossom()
331 for (blossom_iterator_t i = b->sub_blossoms.begin(); i != b->sub_blossoms.end(); ++i) in expand_blossom()
350 … blossom_iterator_t expand_T_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_T_blossom()
357 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
669 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end();) in augmenting()
881 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
912 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp100 for (blossom_iterator_t bi = sub_blossoms.begin(); bi != sub_blossoms.end(); ++bi) in set_base()
147 typedef typename std::vector<blossom_ptr_t>::iterator blossom_iterator_t; typedef in boost::weighted_augmenting_path_finder
242 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in add_sub_blossom()
328 … blossom_iterator_t expand_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_blossom()
331 for (blossom_iterator_t i = b->sub_blossoms.begin(); i != b->sub_blossoms.end(); ++i) in expand_blossom()
350 … blossom_iterator_t expand_T_blossom(blossom_iterator_t bi, std::vector<blossom_ptr_t>& new_ones) in expand_T_blossom()
357 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
669 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end();) in augmenting()
881 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
912 for (blossom_iterator_t bi = top_blossoms.begin(); bi != top_blossoms.end(); ++bi) in adjust_dual()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dmaximum_weighted_matching.hpp114 for (blossom_iterator_t bi = sub_blossoms.begin(); in set_base()
274 for (blossom_iterator_t bi = top_blossoms.begin(); in add_sub_blossom()
372 blossom_iterator_t expand_blossom( in expand_blossom()
376 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_blossom()
399 blossom_iterator_t expand_T_blossom( in expand_T_blossom()
408 blossom_iterator_t next_bi = expand_blossom(bi, new_ones); in expand_T_blossom()
410 for (blossom_iterator_t i = b->sub_blossoms.begin(); in expand_T_blossom()
755 for (blossom_iterator_t bi = top_blossoms.begin(); in augmenting()
997 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
1031 for (blossom_iterator_t bi = top_blossoms.begin(); in adjust_dual()
[all …]