27 #ifndef SRC_EDIT_COSTS_CMU_HPP_ 28 #define SRC_EDIT_COSTS_CMU_HPP_ 52 template<
class UserNodeLabel,
class UserEdgeLabel>
64 CMU(
double node_ins_del_cost = 100000,
double alpha = 0.5);
70 virtual double node_rel_cost_fun(
const UserNodeLabel & node_label_1,
const UserNodeLabel & node_label_2)
const final;
72 virtual void vectorize_node_label(
const UserNodeLabel & node_label, std::vector<double> & vector_representation)
const final;
78 virtual double edge_rel_cost_fun(
const UserEdgeLabel & edge_label_1,
const UserEdgeLabel & edge_label_2)
const final;
82 double node_ins_del_cost_;
ged::EditCosts class declaration.
virtual double node_ins_cost_fun(const UserNodeLabel &node_label) const final
Node insertions cost function.
virtual double edge_del_cost_fun(const UserEdgeLabel &edge_label) const final
Edge deletion cost function.
virtual double edge_ins_cost_fun(const UserEdgeLabel &edge_label) const final
Edge insertion cost function.
virtual double node_del_cost_fun(const UserNodeLabel &node_label) const final
Node deletion cost function.
CMU(double node_ins_del_cost=100000, double alpha=0.5)
Constructor.
Edit costs for graphs contain in CMU dataset.
virtual void vectorize_node_label(const UserNodeLabel &node_label, std::vector< double > &vector_representation) const final
Computes a node label's representation as a real-valued vector.
Global namespace for GEDLIB.
virtual double node_rel_cost_fun(const UserNodeLabel &node_label_1, const UserNodeLabel &node_label_2) const final
Node relabeling cost function.
ged::CMU class definition.
Abstract class for defining edit cost functions.
virtual double edge_rel_cost_fun(const UserEdgeLabel &edge_label_1, const UserEdgeLabel &edge_label_2) const final
Edge relabeling cost function.