51#if defined __LAL_DEBUG_DMax_Unc_BnB
59namespace unconstrained {
162#if defined __LAL_DEBUG_DMax_Unc_BnB
165[[nodiscard]]
inline constexpr std::string_view reason_discard_to_string
172 return "Placing this vertex will produce a bipartite arrangement";
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";
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";
204 return "The largest cut is not large enough";
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";
223[[nodiscard]]
inline inline constexpr std::size_t reason_discard_to_index
226 return static_cast<std::size_t
>(rd);
231[[nodiscard]]
static inline constexpr reason_discard index_to_reason_discard
232(
const std::size_t i)
noexcept
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.
@ hub_disallows_placement_of_antennas
@ none
No reason to discard. Use the vertex.
@ will_produce_bipartite_arrangement
Placing the vertex will produce a bipartite arrangement.
@ node_disallows_placement_of_neighbors
@ thistle_in_bridge_is_not_the_lowest
@ nodes_of_equal_level_disobey_lexicographic_order
@ node_leaves_disobey_lexicographic_order
@ level_signature_will_not_be_nonincreasing
@ roots_of_isomorphic_subtrees_disobey_lexicographic_order
@ adjacent_vertices_with_equal_level_value
@ node_of_antenna_as_thistle
Placing this vertex will produce a thistle located at an antenna.
@ placement_fails_level_propagation
@ 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