LAL: Linear Arrangement Library 24.10.00
A library focused on algorithms on linear arrangements of graphs.
|
A wrapper to easily use identity arrangements. More...
#include <arrangement_wrapper.hpp>
Public Member Functions | |
arrangement_wrapper (const lal::linear_arrangement &arr) noexcept | |
Constructor with arrangement. | |
template<typename param_t > | |
uint64_t | operator[] (const param_t &p) const noexcept |
Access operator. | |
std::size_t | size () const noexcept |
Returns the size of the arrangement. | |
Private Attributes | |
const lal::linear_arrangement & | m_arr |
Constant reference to actual arrangement. | |
A wrapper to easily use identity arrangements.
This reduces execution time: it prevents the explicit construction of the identity arrangement (which involves allocation of memory, ...)
|
inlinenodiscardnoexcept |
Access operator.
Only when the arrangement is not the identity arrangement, the method accessess m_arr.
p | Either a lal::node_t or a lal::position_t. |