LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
Loading...
Searching...
No Matches
reason_discard.hpp
1/*********************************************************************
2 *
3 * Linear Arrangement Library - A library that implements a collection
4 * algorithms for linear arrangments of graphs.
5 *
6 * Copyright (C) 2019 - 2024
7 *
8 * This file is part of Linear Arrangement Library. The full code is available
9 * at:
10 * https://github.com/LAL-project/linear-arrangement-library.git
11 *
12 * Linear Arrangement Library is free software: you can redistribute it
13 * and/or modify it under the terms of the GNU Affero General Public License
14 * as published by the Free Software Foundation, either version 3 of the
15 * License, or (at your option) any later version.
16 *
17 * Linear Arrangement Library is distributed in the hope that it will be
18 * useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
20 * GNU Affero General Public License for more details.
21 *
22 * You should have received a copy of the GNU Affero General Public License
23 * along with Linear Arrangement Library. If not, see <http://www.gnu.org/licenses/>.
24 *
25 * Contact:
26 *
27 * LluĂ­s Alemany Puig (lluis.alemany.puig@upc.edu)
28 * LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
29 * CQL (Complexity and Quantitative Linguistics Lab)
30 * Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona. CATALONIA, SPAIN
31 * Webpage: https://cqllab.upc.edu/people/lalemany/
32 *
33 * Juan Luis Esteban (esteban@cs.upc.edu)
34 * LOGPROG: Logics and Programming Research Group
35 * Office 110, Omega building
36 * Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona. CATALONIA, SPAIN
37 * Webpage: https://www.cs.upc.edu/~esteban/
38 *
39 * Ramon Ferrer i Cancho (rferrericancho@cs.upc.edu)
40 * LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
41 * CQL (Complexity and Quantitative Linguistics Lab)
42 * Office 220, Omega building
43 * Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona. CATALONIA, SPAIN
44 * Webpage: https://cqllab.upc.edu/people/rferrericancho/
45 *
46 ********************************************************************/
47
48#pragma once
49
50// C++ includes
51#if defined __LAL_DEBUG_DMax_Unc_BnB
52#include <string_view>
53#endif
54#include <cstdint>
55
56namespace lal {
57namespace detail {
58namespace DMax {
59namespace unconstrained {
60
161
162#if defined __LAL_DEBUG_DMax_Unc_BnB
165[[nodiscard]] inline constexpr std::string_view reason_discard_to_string
166(const reason_discard at) noexcept
167{
168 switch (at) {
170 return "Success";
172 return "Placing this vertex will produce a bipartite arrangement";
173
174 /* -- paths -- */
176 return "Vertex of antenna as thistle";
178 return "The vertex is not adequate to be thistle in its bridge";
180 return "The level of the hub of an antenna is not Ok for the placement of the antenna";
182 return "Placing this vertex will eventually prevent the placement of some other vertex in the same path";
183
184 /* -- level values -- */
186 return "Conflict in the prediction of level value";
188 return "The level signature will not be non-increasing";
190 return "None of the vertices of a path (degree <= 2) has been assigned";
192 return "Some leaf will be misplaced";
194 return "Some degree-2 vertex of a path (of level +2) will be misplaced";
196 return "Some degree-2 vertex of a path (of level -2) will be misplaced";
198 return "There will be connected vertices (by an edge) with the same level value";
200 return "Placing will eventually lead to breaking two of Nurse's properties";
201
202 /* -- optimality -- */
204 return "The largest cut is not large enough";
205
206 /* -- symmetry breaking -- */
208 return "Vertices of equal level value are not arranged in lexicographic order";
210 return "Leaves attached to the same vertex are not arranged in lexicographic order";
212 return "Roots of isomorphic subtrees are not arranged in lexicographic order";
213
214 /* -- */
216 return "?";
217 }
218 return "";
219}
220
223[[nodiscard]] inline inline constexpr std::size_t reason_discard_to_index
224(const reason_discard rd) noexcept
225{
226 return static_cast<std::size_t>(rd);
227}
228
231[[nodiscard]] static inline constexpr reason_discard index_to_reason_discard
232(const std::size_t i) noexcept
233{
234 return static_cast<reason_discard>(i);
235}
236#endif
237
238} // -- namespace unconstrained
239} // -- namespace DMax
240} // -- namespace detail
241} // -- namespace lal
reason_discard
The many different reasons to not assign a vertex to the arrangement.
Definition reason_discard.hpp:67
@ largest_cut_below_minimum
The largest cut is below the lower bound for the maximum cut value.
@ none
No reason to discard. Use the vertex.
@ will_produce_bipartite_arrangement
Placing the vertex will produce a bipartite arrangement.
@ node_of_antenna_as_thistle
Placing this vertex will produce a thistle located at an antenna.
@ placement_is_in_conflict_with_level_prediction
The level prediction made will not be met.
Main namespace of the library.
Definition basic_types.hpp:48