result.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_ENV_RESULT_HPP_
#define SRC_ENV_RESULT_HPP_

#include "common_types.hpp"
#include "node_map.hpp"

namespace ged {

class Result {

public:

    Result();

    void set_lower_bound(double lower_bound);

    double lower_bound() const;

    double upper_bound() const;

    std::size_t add_node_map(std::size_t num_nodes_g, std::size_t num_nodes_h);

    std::size_t add_node_map(const NodeMap & node_map);

    NodeMap & node_map(std::size_t index_node_map);

    bool is_non_redundant_node_map(std::size_t index_node_map);

    std::vector<NodeMap> & node_maps();

    std::size_t num_node_maps() const;

    void sort_node_maps_and_set_upper_bound(std::size_t num_node_maps = std::numeric_limits<std::size_t>::max());

private:

    std::vector<NodeMap> node_maps_;

    double lower_bound_;
};

}

#include "result.ipp"

#endif /* SRC_ENV_RESULT_HPP_ */