27 #ifndef SRC_METHODS_HED_HPP_ 28 #define SRC_METHODS_HED_HPP_ 45 template<
class UserNodeLabel,
class UserEdgeLabel>
58 std::size_t num_threads_;
64 virtual bool ged_parse_option_(
const std::string & option,
const std::string & arg)
final;
Computes a lower bound for general edit costs.
Contains the standardized input data along with basic functionality.
virtual std::string ged_valid_options_string_() const final
Returns string of all valid options.
A wrapper structure for the result of calls to ged::GEDMethod::run_as_util() and ged::GEDMethod::ged_...
Abstract class for the (suboptimal) computation of the graph edit distance.
virtual void ged_run_(const GEDGraph &g, const GEDGraph &h, Result &result) final
Runs the method with options specified by set_options().
The normalized input graphs used by GEDLIB. All labels are integers.
Global namespace for GEDLIB.
virtual bool ged_parse_option_(const std::string &option, const std::string &arg) final
Parses one option.
virtual void ged_set_default_options_() final
Sets all options to default values.
std::size_t NodeID
Internally used vertex ID type.
Model
Selects a model for solving LSAPE with the Hungarian algorithm.