level_value_propagation_origin.hpp

/*********************************************************************
 *
 * Linear Arrangement Library - A library that implements a collection
 * algorithms for linear arrangments of graphs.
 *
 * Copyright (C) 2019 - 2024
 *
 * This file is part of Linear Arrangement Library. The full code is available
 * at:
 *      https://github.com/LAL-project/linear-arrangement-library.git
 *
 * Linear Arrangement Library is free software: you can redistribute it
 * and/or modify it under the terms of the GNU Affero General Public License
 * as published by the Free Software Foundation, either version 3 of the
 * License, or (at your option) any later version.
 *
 * Linear Arrangement Library 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 Affero General Public License for more details.
 *
 * You should have received a copy of the GNU Affero General Public License
 * along with Linear Arrangement Library.  If not, see <http://www.gnu.org/licenses/>.
 *
 * Contact:
 *
 *     Lluís Alemany Puig (lluis.alemany.puig@upc.edu)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         CQL (Complexity and Quantitative Linguistics Lab)
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://cqllab.upc.edu/people/lalemany/
 *
 *     Juan Luis Esteban (esteban@cs.upc.edu)
 *         LOGPROG: Logics and Programming Research Group
 *         Office 110, Omega building
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://www.cs.upc.edu/~esteban/
 *
 *     Ramon Ferrer i Cancho (rferrericancho@cs.upc.edu)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         CQL (Complexity and Quantitative Linguistics Lab)
 *         Office 220, Omega building
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://cqllab.upc.edu/people/rferrericancho/
 *
 ********************************************************************/
 
#pragma once
 
// C++ includes
#if defined __LAL_DEBUG_DMax_Unc_BnB
#include <string_view>
#endif
#include <cstdint>
 
namespace lal {
namespace detail {
namespace DMax {
namespace unconstrained {
 
enum class LV_propagation_origin : int8_t {
    antenna_leaf,
    antenna_internal,
    antenna_hub,
    bridge_hub_1,
    bridge_hub_2,
    bridge_lowest_pm2,
    bridge_lowest_0,
    bridge_internal_left,
    bridge_internal_right,
    self,
    none
};
 
#if defined __LAL_DEBUG_DMax_Unc_BnB
[[nodiscard]] inline constexpr std::string_view LV_propagation_origin_to_string
(const LV_propagation_origin at) noexcept
{
    switch (at) {
    case LV_propagation_origin::antenna_leaf: return "Antenna (leaf)";
    case LV_propagation_origin::antenna_internal: return "Antenna (internal)";
    case LV_propagation_origin::antenna_hub: return "Antenna (hub)";
    case LV_propagation_origin::bridge_internal_left: return "Bridge (internal left)";
    case LV_propagation_origin::bridge_internal_right: return "Bridge (internal right)";
    case LV_propagation_origin::bridge_lowest_pm2: return "Bridge (lowest -- level +-2)";
    case LV_propagation_origin::bridge_lowest_0: return "Bridge (lowest -- level 0)";
    case LV_propagation_origin::bridge_hub_1: return "Bridge (hub 1)";
    case LV_propagation_origin::bridge_hub_2: return "Bridge (hub 2)";
    case LV_propagation_origin::self: return "Self";
    case LV_propagation_origin::none: return "None";
    }
    return "";
}
 
[[nodiscard]] inline constexpr std::string_view LV_propagation_origin_to_short_string
(const LV_propagation_origin at) noexcept
{
    switch (at) {
    case LV_propagation_origin::antenna_leaf: return "al";
    case LV_propagation_origin::antenna_internal: return "ai";
    case LV_propagation_origin::antenna_hub: return "ah";
    case LV_propagation_origin::bridge_internal_left: return "bil";
    case LV_propagation_origin::bridge_internal_right: return "bir";
    case LV_propagation_origin::bridge_lowest_pm2: return "bl2";
    case LV_propagation_origin::bridge_lowest_0: return "bl0";
    case LV_propagation_origin::bridge_hub_1: return "bh1";
    case LV_propagation_origin::bridge_hub_2: return "bh2";
    case LV_propagation_origin::self: return "s";
    case LV_propagation_origin::none: return " ";
    }
    return "?";
}
#endif
 
} // -- namespace unconstrained
} // -- namespace DMax
} // -- namespace detail
} // -- namespace lal