Home
last modified time | relevance | path

Searched refs:critical_edge (Results 1 – 8 of 8) sorted by relevance

/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp198 critical_edge = vertex_pair_to_edge_map_t(critical_edge_vector.begin(), vm); in weighted_augmenting_path_finder()
733 … if (critical_edge[*j][*i] != null_edge && min_slack > slack(critical_edge[*j][*i].first)) in blossoming()
735 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
736 b_vi = critical_edge[*j][*i]; in blossoming()
739 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
744 if (critical_edge[b_base][*i] != null_edge) in blossoming()
745 gamma[b_base] = std::min(gamma[b_base], slack(critical_edge[b_base][*i].first)); in blossoming()
835 if (critical_edge[v_prime][w_prime] == null_edge || in augment_matching()
836 slack(critical_edge[v_prime][w_prime].first) > slack(current_edge)) in augment_matching()
969 … if (critical_edge[*i][*j] != null_edge && slack(critical_edge[*i][*j].first) == 0) in adjust_dual()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dmaximum_weighted_matching.hpp229 critical_edge in weighted_augmenting_path_finder()
824 if (critical_edge[*j][*i] != null_edge in blossoming()
827 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
828 b_vi = critical_edge[*j][*i]; in blossoming()
831 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
836 if (critical_edge[b_base][*i] != null_edge) in blossoming()
942 if (critical_edge[v_prime][w_prime] == null_edge in augment_matching()
946 critical_edge[v_prime][w_prime] in augment_matching()
949 critical_edge[w_prime][v_prime] in augment_matching()
1098 if (critical_edge[*i][*j] != null_edge in adjust_dual()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dmaximum_weighted_matching.hpp229 critical_edge in weighted_augmenting_path_finder()
824 if (critical_edge[*j][*i] != null_edge in blossoming()
827 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
828 b_vi = critical_edge[*j][*i]; in blossoming()
831 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
836 if (critical_edge[b_base][*i] != null_edge) in blossoming()
942 if (critical_edge[v_prime][w_prime] == null_edge in augment_matching()
946 critical_edge[v_prime][w_prime] in augment_matching()
949 critical_edge[w_prime][v_prime] in augment_matching()
1098 if (critical_edge[*i][*j] != null_edge in adjust_dual()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dmaximum_weighted_matching.hpp229 critical_edge in weighted_augmenting_path_finder()
824 if (critical_edge[*j][*i] != null_edge in blossoming()
827 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
828 b_vi = critical_edge[*j][*i]; in blossoming()
831 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
836 if (critical_edge[b_base][*i] != null_edge) in blossoming()
942 if (critical_edge[v_prime][w_prime] == null_edge in augment_matching()
946 critical_edge[v_prime][w_prime] in augment_matching()
949 critical_edge[w_prime][v_prime] in augment_matching()
1098 if (critical_edge[*i][*j] != null_edge in adjust_dual()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp198 critical_edge = vertex_pair_to_edge_map_t(critical_edge_vector.begin(), vm); in weighted_augmenting_path_finder()
733 … if (critical_edge[*j][*i] != null_edge && min_slack > slack(critical_edge[*j][*i].first)) in blossoming()
735 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
736 b_vi = critical_edge[*j][*i]; in blossoming()
739 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
744 if (critical_edge[b_base][*i] != null_edge) in blossoming()
745 gamma[b_base] = std::min(gamma[b_base], slack(critical_edge[b_base][*i].first)); in blossoming()
835 if (critical_edge[v_prime][w_prime] == null_edge || in augment_matching()
836 slack(critical_edge[v_prime][w_prime].first) > slack(current_edge)) in augment_matching()
969 … if (critical_edge[*i][*j] != null_edge && slack(critical_edge[*i][*j].first) == 0) in adjust_dual()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp198 critical_edge = vertex_pair_to_edge_map_t(critical_edge_vector.begin(), vm); in weighted_augmenting_path_finder()
733 … if (critical_edge[*j][*i] != null_edge && min_slack > slack(critical_edge[*j][*i].first)) in blossoming()
735 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
736 b_vi = critical_edge[*j][*i]; in blossoming()
739 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
744 if (critical_edge[b_base][*i] != null_edge) in blossoming()
745 gamma[b_base] = std::min(gamma[b_base], slack(critical_edge[b_base][*i].first)); in blossoming()
835 if (critical_edge[v_prime][w_prime] == null_edge || in augment_matching()
836 slack(critical_edge[v_prime][w_prime].first) > slack(current_edge)) in augment_matching()
969 … if (critical_edge[*i][*j] != null_edge && slack(critical_edge[*i][*j].first) == 0) in adjust_dual()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dmaximum_weighted_matching.hpp229 critical_edge in weighted_augmenting_path_finder()
824 if (critical_edge[*j][*i] != null_edge in blossoming()
827 min_slack = slack(critical_edge[*j][*i].first); in blossoming()
828 b_vi = critical_edge[*j][*i]; in blossoming()
831 critical_edge[b_base][*i] = critical_edge[*i][b_base] = b_vi; in blossoming()
836 if (critical_edge[b_base][*i] != null_edge) in blossoming()
942 if (critical_edge[v_prime][w_prime] == null_edge in augment_matching()
946 critical_edge[v_prime][w_prime] in augment_matching()
949 critical_edge[w_prime][v_prime] in augment_matching()
1098 if (critical_edge[*i][*j] != null_edge in adjust_dual()
[all …]
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/filetests/filetests/licm/
H A Dcritical-edge.clif6 function %critical_edge(i32, i32) -> i32 {
30 ; sameln: function %critical_edge