graph_search_evaluator.h

[詳解]

 
 
// Copyright(c) 2023-2025 Design Engineering Laboratory, Saitama University
// Released under the MIT license
// https://opensource.org/licenses/mit-license.php
 
#ifndef DESIGNLAB_GRAPH_SEARCH_EVALUATOR_H_
#define DESIGNLAB_GRAPH_SEARCH_EVALUATOR_H_
 
#include <map>
#include <vector>
 
 
namespace designlab
{
 
struct GraphSearchEvaluationValue final
{
    using Tag = int;
 
    constexpr static float kMaxEvaluationValue = 1.0e+7f;
    constexpr static float kMinEvaluationValue = -1.0e+7f;
 
    std::map<Tag, float> value;
};
 
 
class GraphSearchEvaluator final
{
    using Tag = GraphSearchEvaluationValue::Tag;  // 読みやすさのため，別名をつける．
 
public:
    struct EvaluationMethod final
    {
        bool is_lower_better;  
 
        float margin;  
    };
 
    GraphSearchEvaluator() = delete;  
 
    GraphSearchEvaluator(const std::map<Tag, EvaluationMethod>& evaluation_method_map,
                         const std::vector<Tag>& evaluation_priority_list);
 
    ~GraphSearchEvaluator() = default;
 
 
    bool LeftIsBetter(const GraphSearchEvaluationValue& left,
                      const GraphSearchEvaluationValue& right,
                      bool return_true_case_of_equal = true) const;
 
    bool LeftIsBetterWithTag(const GraphSearchEvaluationValue& left,
                             const GraphSearchEvaluationValue& right,
                             Tag tag,
                             bool return_true_case_of_equal = true) const;
 
    GraphSearchEvaluationValue InitializeEvaluationValue() const;
 
private:
    const std::map<Tag, EvaluationMethod> evaluation_method_map_;  
 
    const std::vector<Tag> evaluation_priority_list_;
};
 
}  // namespace designlab
 
 
#endif  // DESIGNLAB_GRAPH_SEARCH_EVALUATOR_H_