27 #ifndef SRC_EDIT_COSTS_LETTER_IPP_ 28 #define SRC_EDIT_COSTS_LETTER_IPP_ 33 Letter<GXLLabel, GXLLabel>::
38 Letter(
double node_ins_del_cost,
double edge_ins_del_cost,
double alpha) :
39 node_ins_del_cost_{node_ins_del_cost},
40 edge_ins_del_cost_{edge_ins_del_cost},
47 return alpha_ * node_ins_del_cost_;
54 return alpha_ * node_ins_del_cost_;
61 double x_l_minus_x_r(std::stod(node_label_1.at(
"x")) - std::stod(node_label_2.at(
"x")));
62 double y_l_minus_y_r(std::stod(node_label_1.at(
"y")) - std::stod(node_label_2.at(
"y")));
63 return alpha_ * std::sqrt(std::pow(x_l_minus_x_r, 2) + std::pow(y_l_minus_y_r, 2));
70 return (1 - alpha_) * edge_ins_del_cost_;
77 return (1 - alpha_) * edge_ins_del_cost_;
virtual double edge_ins_cost_fun(const UserEdgeLabel &edge_label) const final
Edge insertion cost function.
virtual double node_rel_cost_fun(const UserNodeLabel &node_label_1, const UserNodeLabel &node_label_2) const final
Node relabeling cost function.
Letter(double node_ins_del_cost=0.9, double edge_ins_del_cost=1.7, double alpha=0.75)
Constructor.
std::map< std::string, std::string > GXLLabel
Type of node and edge labels of graphs given in the .gxl file format.
virtual double edge_del_cost_fun(const UserEdgeLabel &edge_label) const final
Edge deletion cost function.
virtual double node_del_cost_fun(const UserNodeLabel &node_label) const final
Node deletion cost function.
Global namespace for GEDLIB.
virtual double node_ins_cost_fun(const UserNodeLabel &node_label) const final
Node insertions cost function.
virtual double edge_rel_cost_fun(const UserEdgeLabel &edge_label_1, const UserEdgeLabel &edge_label_2) const final
Edge relabeling cost function.