GEDLIB
1.0
|
Computes lower and upper bounds for general edit costs. More...
#include <branch_tight.hpp>
Private Member Functions | |
virtual void | ged_run_ (const GEDGraph &g, const GEDGraph &h, Result &result) final |
Runs the method with options specified by set_options(). More... | |
virtual void | ged_set_default_options_ () final |
Sets all options to default values. More... | |
virtual bool | ged_parse_option_ (const std::string &option, const std::string &arg) final |
Parses one option. More... | |
virtual std::string | ged_valid_options_string_ () const |
Returns string of all valid options. More... | |
Additional Inherited Members | |
![]() | |
virtual | ~GEDMethod ()=0 |
Pure virtual destructor. More... | |
GEDMethod (const GEDData< UserNodeLabel, UserEdgeLabel > &ged_data) | |
Constructor. More... | |
void | set_options (const std::string &options) |
Sets the options of the method. More... | |
void | run (GEDGraph::GraphID g_id, GEDGraph::GraphID h_id) |
Runs the method with options specified by set_options(). More... | |
void | run_as_util (const GEDGraph &g, const GEDGraph &h, Result &result) |
Runs the method with options specified by set_options(). More... | |
void | init () |
Initializes the method with options specified by set_options(). | |
double | get_upper_bound () const |
Returns an upper bound. More... | |
double | get_lower_bound () const |
Returns a lower bound. More... | |
Seconds | get_runtime () const |
Returns the runtime. More... | |
Seconds | get_init_time () const |
Returns the initialization time. More... | |
const NodeMap & | get_node_map () const |
Returns a graph matching. More... | |
![]() | |
bool | initialized_ |
A flag that equals true if init() has been called and false otherwise. | |
const GEDData< UserNodeLabel, UserEdgeLabel > & | ged_data_ |
The data on which the method is run. | |
Computes lower and upper bounds for general edit costs.
Implements the method BranchTight suggested in:
Supports the following options:
--<option> <arg> | modified parameter | default | more information |
---|---|---|---|
--iterations <convertible to int greater equal 0> | maximal number of iterations | 20 | https:://doi.org/10.1109/TKDE.2017.2772243 if 0 , no iteration based termination criterion is used |
--time-limit <convertible to double> | time limit in seconds | 0 | https:://doi.org/10.1109/TKDE.2017.2772243 if less or equal 0 , no time limit is enforced |
--range <convertible to double> | range | 0 | https:://doi.org/10.1109/TKDE.2017.2772243 if less or equal 0 , no range based termination criterion is used |
--epsilon <convertible to double> | range | 0 | https:://doi.org/10.1109/TKDE.2017.2772243 if less or equal 0 , no convergence based termination criterion is used |
--regularize NAIVE|K-FACTOR | regularization method | NAIVE | https:://doi.org/10.1109/TKDE.2017.2772243 |
--threads <convertible to int greater 0> | number of threads | 1 | n.a. |
--upper-bound NO|FIRST|LAST|BEST | upper bound returned by the method | BEST | https:://doi.org/10.1109/TKDE.2017.2772243 |
Definition at line 51 of file branch_tight.hpp.
|
finalprivatevirtual |
Parses one option.
[in] | option | The name of the option. |
[in] | arg | The argument of the option. |
true
if option
is a valid option name for the method and false
otherwise. Reimplemented from ged::GEDMethod< UserNodeLabel, UserEdgeLabel >.
Definition at line 73 of file branch_tight.ipp.
|
finalprivatevirtual |
Runs the method with options specified by set_options().
[in] | g | Input graph. |
[in] | h | Input graph. |
[out] | result | Result variable. |
Reimplemented from ged::GEDMethod< UserNodeLabel, UserEdgeLabel >.
Definition at line 167 of file branch_tight.ipp.
|
finalprivatevirtual |
Sets all options to default values.
Reimplemented from ged::GEDMethod< UserNodeLabel, UserEdgeLabel >.
Definition at line 53 of file branch_tight.ipp.
|
privatevirtual |
Returns string of all valid options.
[–<option> <arg>] [...]
. Reimplemented from ged::GEDMethod< UserNodeLabel, UserEdgeLabel >.
Definition at line 66 of file branch_tight.ipp.