subgraph.hpp

Go to the documentation of this file.

/***************************************************************************
*                                                                          *
*   Copyright (C) 2018 by David B. Blumenthal                              *
*                                                                          *
*   This file is part of GEDLIB.                                           *
*                                                                          *
*   GEDLIB is free software: you can redistribute it and/or modify it      *
*   under the terms of the GNU Lesser General Public License as published  *
*   by the Free Software Foundation, either version 3 of the License, or   *
*   (at your option) any later version.                                    *
*                                                                          *
*   GEDLIB is distributed in the hope that it will be useful,              *
*   but WITHOUT ANY WARRANTY; without even the implied warranty of         *
*   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the           *
*   GNU Lesser General Public License for more details.                    *
*                                                                          *
*   You should have received a copy of the GNU Lesser General Public       *
*   License along with GEDLIB. If not, see <http://www.gnu.org/licenses/>. *
*                                                                          *
***************************************************************************/

#ifndef SRC_METHODS_SUBGRAPH_HPP_
#define SRC_METHODS_SUBGRAPH_HPP_

namespace ged {

template<class UserNodeLabel, class UserEdgeLabel>
class Subgraph : public LSAPEBasedMethod<UserNodeLabel, UserEdgeLabel> {

public:

    virtual ~Subgraph();

    Subgraph(const GEDData<UserNodeLabel, UserEdgeLabel> & ged_data);

private:

    std::size_t depth_;

    std::size_t min_depth_;

    std::size_t max_depth_;

    std::string infile_;

    std::string outfile_;

    std::string exact_options_;

    std::map<GEDGraph::GraphID, GEDGraph> subgraphs_;

    Options::GEDMethod exact_method_;

    // Inherited member functions from LSAPEBasedMethod.

    virtual void lsape_set_default_options_() final;

    virtual std::string lsape_valid_options_string_() const final;

    virtual bool lsape_parse_option_(const std::string & option, const std::string & arg) final;

    virtual void lsape_init_graph_(const GEDGraph & graph) final;

    virtual void lsape_init_() final;

    virtual void lsape_populate_instance_(const GEDGraph & g, const GEDGraph & h, DMatrix & master_problem) final;

    virtual void lsape_pre_graph_init_(bool called_at_runtime) final;

    // Helper member functions.

    double compute_substitution_cost_(const GEDGraph & g, const GEDGraph & h, GEDGraph::NodeID i, GEDGraph::NodeID k, GEDMethod<UserNodeLabel, UserEdgeLabel> * exact_method) const;

    double compute_deletion_cost_(const GEDGraph & g, GEDGraph::NodeID i) const;

    double compute_insertion_cost_(const GEDGraph & h, GEDGraph::NodeID k) const;

    void build_subgraphs_(const GEDGraph & graph);

    void build_subgraph_(const GEDGraph & graph, GEDGraph::NodeID node);

    GEDGraph::GraphID subgraph_id_(const GEDGraph & graph, GEDGraph::NodeID node) const;

    void build_subgraph_dfs_(const GEDGraph & graph, GEDGraph::NodeID current_node, std::size_t depth_current_node, GEDGraph::NodeNodeMap & ids_in_subgraph, GEDGraph & subgraph);

    bool load_config_file_() const;

    GEDMethod<UserNodeLabel, UserEdgeLabel> * exact_method_factory_() const;

};

}

#endif /* SRC_METHODS_SUBGRAPH_HPP_ */