GEDLIB
1.0
|
Computes an upper bound for general edit costs. More...
#include <ipfp.hpp>
Private Member Functions | |
void | ls_run_from_initial_solution_ (const GEDGraph &g, const GEDGraph &h, double lower_bound, const NodeMap &initial_node_map, NodeMap &output_node_map) final |
Runs the local search from an initial node map. More... | |
virtual void | ls_runtime_init_ (const GEDGraph &g, const GEDGraph &h) final |
Initializes the method for a run between two graphs. More... | |
virtual void | ls_set_default_options_ () final |
Sets all options that are not among the ones shared by all derived classes of ged::LSBasedMethod to default values. More... | |
virtual bool | ls_parse_option_ (const std::string &options, const std::string &arg) final |
Parses one option that is not among the ones shared by all derived classes of ged::LSBasedMethod. More... | |
virtual std::string | ls_valid_options_string_ () const final |
Returns string of all valid options that are not among the ones shared by all derived classes of ged::LSBasedMethod. More... | |
Additional Inherited Members | |
Public Member Functions inherited from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel > | |
virtual | ~LSBasedMethod ()=0 |
Pure virtual destructor. More... | |
LSBasedMethod (const GEDData< UserNodeLabel, UserEdgeLabel > &ged_data) | |
Constructor. More... | |
Public Member Functions inherited from ged::GEDMethod< UserNodeLabel, UserEdgeLabel > | |
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... | |
Protected Attributes inherited from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel > | |
std::size_t | num_threads_ |
The number of threads to be used. | |
Protected Attributes inherited from ged::GEDMethod< UserNodeLabel, UserEdgeLabel > | |
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 an upper bound for general edit costs.
Implements the method IPFP (Frank-Wolfe for QAP and GED) suggested in:
the reduction QAPE suggested in:
the extension m-IPFP suggested in:
and the extension C-QAP suggested in:
Supports the following options:
--<option> <arg> | modified parameter | default | more information |
---|---|---|---|
--iterations <convertible to int greater equal 0> | maximal number of iterations | 100 | if 0 , no iteration based termination criterion is used |
--time-limit <convertible to double> | time limit in seconds | 0 | if less or equal 0 , no time limit is enforced |
--epsilon <convertible to double> | convergence threshold | 0.001 | if less or equal 0 , no convergence based termination criterion is used |
--lsape-model ECBP|EBP|FLWC|FLCC|FBP|SFBP|FBP0 | model for optimally solving LSAPE | ECBP | ged::LSAPESolver::Model |
--quadratic-model QAPE|B-QAP|C-QAP | quadratic assignment model | QAPE | ICPR paper |
|
finalprivatevirtual |
Parses one option that is not among the ones shared by all derived classes of ged::LSBasedMethod.
[in] | option | The name of the option. |
[in] | arg | The argument of the option. |
option
is a valid option name for the method and false otherwise. Reimplemented from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel >.
|
finalprivatevirtual |
Runs the local search from an initial node map.
[in] | g | Input graph. |
[in] | h | Input graph. |
[in] | lower_bound | A lower bound for GED which can be used as a termination criterion. |
[in] | initial_node_map | Initial node map. |
[out] | output_node_map | Node map constructed by local search. |
Reimplemented from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel >.
|
finalprivatevirtual |
Initializes the method for a run between two graphs.
[in] | g | Input graph. |
[in] | h | Input graph. |
Reimplemented from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel >.
|
finalprivatevirtual |
Sets all options that are not among the ones shared by all derived classes of ged::LSBasedMethod to default values.
Reimplemented from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel >.
|
finalprivatevirtual |
Returns string of all valid options that are not among the ones shared by all derived classes of ged::LSBasedMethod.
Reimplemented from ged::LSBasedMethod< UserNodeLabel, UserEdgeLabel >.