Home
last modified time | relevance | path

Searched refs:edge_property_t (Results 1 – 11 of 11) sorted by relevance

/dports/devel/boost-docs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp28 edge_property_t weight_sum = 0; in matching_weight_sum()
80 edge_property_t dual_var;
159 …dual_var_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>… in weighted_augmenting_path_finder()
160 …pi_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max(… in weighted_augmenting_path_finder()
161 …gamma_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::m… in weighted_augmenting_path_finder()
162 …tau_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max… in weighted_augmenting_path_finder()
182 edge_property_t max_weight = std::numeric_limits<edge_property_t>::min(); in weighted_augmenting_path_finder()
364 edge_property_t min_tau = std::numeric_limits<edge_property_t>::max(); in expand_T_blossom()
729 edge_property_t min_slack = std::numeric_limits<edge_property_t>::max(); in blossoming()
868 edge_property_t delta1, delta2, delta3, delta4, delta; in adjust_dual()
[all …]
/dports/devel/R-cran-BH/BH/inst/include/boost/graph/
H A Dmaximum_weighted_matching.hpp29 edge_weight_t >::type >::value_type edge_property_t; in matching_weight_sum() typedef
31 edge_property_t weight_sum = 0; in matching_weight_sum()
94 edge_property_t dual_var;
178 , dual_var_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
180 , pi_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
182 , gamma_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
184 , tau_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
208 edge_property_t max_weight in weighted_augmenting_path_finder()
417 edge_property_t min_tau in expand_T_blossom()
819 edge_property_t min_slack in blossoming()
[all …]
/dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/
H A Dmaximum_weighted_matching.hpp29 edge_weight_t >::type >::value_type edge_property_t; in matching_weight_sum() typedef
31 edge_property_t weight_sum = 0; in matching_weight_sum()
94 edge_property_t dual_var;
178 , dual_var_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
180 , pi_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
182 , gamma_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
184 , tau_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
208 edge_property_t max_weight in weighted_augmenting_path_finder()
417 edge_property_t min_tau in expand_T_blossom()
819 edge_property_t min_slack in blossoming()
[all …]
/dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/
H A Dmaximum_weighted_matching.hpp29 edge_weight_t >::type >::value_type edge_property_t; in matching_weight_sum() typedef
31 edge_property_t weight_sum = 0; in matching_weight_sum()
94 edge_property_t dual_var;
178 , dual_var_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
180 , pi_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
182 , gamma_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
184 , tau_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
208 edge_property_t max_weight in weighted_augmenting_path_finder()
417 edge_property_t min_tau in expand_T_blossom()
819 edge_property_t min_slack in blossoming()
[all …]
/dports/devel/boost-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp28 edge_property_t weight_sum = 0; in matching_weight_sum()
80 edge_property_t dual_var;
159 …dual_var_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>… in weighted_augmenting_path_finder()
160 …pi_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max(… in weighted_augmenting_path_finder()
161 …gamma_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::m… in weighted_augmenting_path_finder()
162 …tau_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max… in weighted_augmenting_path_finder()
182 edge_property_t max_weight = std::numeric_limits<edge_property_t>::min(); in weighted_augmenting_path_finder()
364 edge_property_t min_tau = std::numeric_limits<edge_property_t>::max(); in expand_T_blossom()
729 edge_property_t min_slack = std::numeric_limits<edge_property_t>::max(); in blossoming()
868 edge_property_t delta1, delta2, delta3, delta4, delta; in adjust_dual()
[all …]
/dports/devel/boost-python-libs/boost_1_72_0/boost/graph/
H A Dmaximum_weighted_matching.hpp28 edge_property_t weight_sum = 0; in matching_weight_sum()
80 edge_property_t dual_var;
159 …dual_var_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>… in weighted_augmenting_path_finder()
160 …pi_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max(… in weighted_augmenting_path_finder()
161 …gamma_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::m… in weighted_augmenting_path_finder()
162 …tau_vector(std::vector<edge_property_t>(num_vertices(g), std::numeric_limits<edge_property_t>::max… in weighted_augmenting_path_finder()
182 edge_property_t max_weight = std::numeric_limits<edge_property_t>::min(); in weighted_augmenting_path_finder()
364 edge_property_t min_tau = std::numeric_limits<edge_property_t>::max(); in expand_T_blossom()
729 edge_property_t min_slack = std::numeric_limits<edge_property_t>::max(); in blossoming()
868 edge_property_t delta1, delta2, delta3, delta4, delta; in adjust_dual()
[all …]
/dports/devel/hyperscan/boost_1_75_0/boost/graph/
H A Dmaximum_weighted_matching.hpp29 edge_weight_t >::type >::value_type edge_property_t; in matching_weight_sum() typedef
31 edge_property_t weight_sum = 0; in matching_weight_sum()
94 edge_property_t dual_var;
178 , dual_var_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
180 , pi_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
182 , gamma_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
184 , tau_vector(std::vector< edge_property_t >( in weighted_augmenting_path_finder()
208 edge_property_t max_weight in weighted_augmenting_path_finder()
417 edge_property_t min_tau in expand_T_blossom()
819 edge_property_t min_slack in blossoming()
[all …]
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/lib/rfnoc/
H A Dgraph.cpp110 auto existing_edge_info = boost::get(edge_property_t(), _graph, *edge_it); in connect()
147 auto existing_edge_info = boost::get(edge_property_t(), _graph, *edge_it); in connect()
195 return (edge_info == boost::get(edge_property_t(), this->_graph, edge_desc)); in disconnect()
245 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, *e_it); in enumerate_edges()
249 result.push_back(boost::get(edge_property_t(), _graph, *e_it)); in enumerate_edges()
605 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, edge); in _assert_edge_props_consistent()
660 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, *it); in _check_topology()
665 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, *it); in _check_topology()
690 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, *it); in _find_neighbour()
702 graph_edge_t edge_info = boost::get(edge_property_t(), _graph, *it); in _find_neighbour()
/dports/comms/uhd/uhd-90ce6062b6b5df2eddeee723777be85108e4e7c7/host/lib/include/uhdlib/rfnoc/
H A Dgraph.hpp111 struct edge_property_t struct in uhd::rfnoc::detail::graph_t
116 using RfnocEdgeProperty = boost::property<edge_property_t, graph_edge_t>;
142 graph_edge_t edge_info = boost::get(edge_property_t(), *_graph, e); in operator ()()
/dports/misc/openmvg/openMVG-2.0/src/openMVG/multiview/
H A Drotation_averaging_l1.cpp91 using edge_property_t = boost::property<boost::edge_weight_t, float>; typedef
92 …t = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, uint32_t, edge_property_t>;
/dports/games/freeorion/freeorion-0.4.10.2/universe/
H A DPathfinder.cpp487 …typedef boost::property<boost::edge_weight_t, double> edge_property_t; ///< a… typedef
494 vertex_property_t, edge_property_t> SystemGraph;