C_ladder.hpp

/*********************************************************************
 *
 * Linear Arrangement Library - A library that implements a collection
 * algorithms for linear arrangments of graphs.
 *
 * Copyright (C) 2019 - 2023
 *
 * 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 (lalemany@cs.upc.edu)
 *         LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)
 *         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/
 *
 *     Ramon Ferrer i Cancho (rferrericancho@cs.upc.edu)
 *         LARCA (Laboratory for Relational Algorithmics, Complexity and Learning)
 *         CQL (Complexity and Quantitative Linguistics Lab)
 *         Office S124, Omega building
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://cqllab.upc.edu/people/rferrericancho/
 *
 ********************************************************************/
 
// C++ includes
#if defined DEBUG
#include <cassert>
#endif
#include <cstring> // for 'memset' below
#include <vector>
 
// lal includes
#include <lal/detail/identity_arrangement.hpp>
#include <lal/detail/graphs/utils.hpp>
#include <lal/detail/data_array.hpp>
 
#define DECIDED_C_GT (upper_bound + 1)
#define DECIDED_C_LE C
 
namespace lal {
namespace detail {
namespace crossings {
 
namespace ladder {
 
// =============================================================================
// ACTUAL ALGORITHM
// =============================================================================
 
template <bool decide_upper_bound, class graph_t, linarr_type arr_type>
uint64_t compute(
    const graph_t& g,
    const linarr_wrapper<arr_type>& arr,
    unsigned char * const __restrict__ bn,
    uint64_t * const __restrict__ L1,
    uint64_t upper_bound
)
noexcept
{
    const uint64_t n = g.get_num_nodes();
 
    /* compute number of crossings */
    uint64_t C = 0;
 
    // no need to reach the last position of the arrangement
    for (position pu = 0; pu < n - 1; ++pu) {
        const node u = arr[position_t{pu}];
 
        // amount of crossings the edges incident to this node and
        // connecting nodes "to the right" of 'u' in the arrangement
        uint64_t S = 0;
 
        // neighbours of node u, as a list of Boolean values.
        detail::get_bool_neighbours<graph_t>(g, u, bn);
 
        for (position pv = pu + 1; pv < n; ++pv) {
            const node v = arr[position_t{pv}];
            S += L1[pv];
 
            // --
            /*if (bn[v]) {
                C += S - L1[q];
                ++L1[q];
            }*/
            C += bn[v]*(S - L1[pv]);
            L1[pv] += bn[v];
            // --
 
            if constexpr (decide_upper_bound) {
                if (C > upper_bound) {
                    return DECIDED_C_GT;
                }
            }
 
            bn[v] = 0;
        }
 
        L1[pu] = 0;
    }
 
    // none of the conditions above were true, so we must have
    // C <= upper_bound
    return C;
}
 
} // -- namespace ladder
 
// =============================================================================
// CALLS TO ALGORITHM
// =============================================================================
 
// ------------------
// single arrangement
 
template <class graph_t, class arrangement_t>
uint64_t n_C_ladder(const graph_t& g, const arrangement_t& arr)
noexcept
{
    const uint64_t n = g.get_num_nodes();
 
#if defined DEBUG
    assert(arr.m_arr.size() == 0 or arr.m_arr.size() == n);
#endif
 
    if (n < 4) { return 0; }
 
    // boolean neighbourhood of nodes
    data_array<unsigned char> boolean_neighborhood(n, 0);
    // array L1 (same as in the pseudocode) ( size n )
    data_array<uint64_t> L1(n, 0);
 
    return ladder::compute<false>
            (g, arr, boolean_neighborhood.begin(), L1.begin(), 0);
}
 
// --------------------
// list of arrangements
 
template <class graph_t>
std::vector<uint64_t> n_C_ladder
(const graph_t& g, const std::vector<linear_arrangement>& arrs)
noexcept
{
    const uint64_t n = g.get_num_nodes();
 
    std::vector<uint64_t> cs(arrs.size(), 0);
    if (n < 4) { return cs; }
 
    // boolean neighbourhood of nodes
    data_array<unsigned char> boolean_neighborhood(n, 0);
    // array L1 (same as in the pseudocode) ( size n )
    data_array<uint64_t> L1(n, 0);
 
    /* compute C for every linear arrangement */
    for (std::size_t i = 0; i < arrs.size(); ++i) {
#if defined DEBUG
        // ensure that no linear arrangement is empty
        assert(arrs[i].size() == n);
#endif
 
        // compute C
        cs[i] = ladder::compute<false>
                (g, nonident_arr(arrs[i]), boolean_neighborhood.begin(), L1.begin(), 0);
 
        boolean_neighborhood.fill(0);
        L1[n - 1] = 0;
    }
 
    return cs;
}
 
// -----------------------------------------------------------------------------
// DECISION
 
// ------------------
// single arrangement
 
template <class graph_t, class arrangement_t>
uint64_t is_n_C_ladder_lesseq_than(
    const graph_t& g,
    const arrangement_t& arr,
    uint64_t upper_bound
)
noexcept
{
    const uint64_t n = g.get_num_nodes();
 
#if defined DEBUG
    assert(arr.m_arr.size() == 0 or arr.m_arr.size() == n);
#endif
 
    if (n < 4) { return 0; }
 
    // boolean neighbourhood of nodes
    data_array<unsigned char> boolean_neighborhood(n, 0);
    // array L1 (same as in the pseudocode) ( size n )
    data_array<uint64_t> L1(n, 0);
 
    return
        ladder::compute<true>
        (g, arr, boolean_neighborhood.begin(), L1.begin(), upper_bound);
}
 
// --------------------
// list of arrangements
 
template <class graph_t>
std::vector<uint64_t> is_n_C_ladder_lesseq_than(
    const graph_t& g,
    const std::vector<linear_arrangement>& arrs,
    uint64_t upper_bound
)
noexcept
{
    const uint64_t n = g.get_num_nodes();
 
    std::vector<uint64_t> cs(arrs.size(), 0);
    if (n < 4) { return cs; }
 
    // boolean neighbourhood of nodes
    data_array<unsigned char> boolean_neighborhood(n, 0);
    // array L1 (same as in the pseudocode) ( size n )
    data_array<uint64_t> L1(n, 0);
 
    /* compute C for every linear arrangement */
    for (std::size_t i = 0; i < arrs.size(); ++i) {
#if defined DEBUG
        // ensure that no linear arrangement is empty
        assert(arrs[i].size() == n);
#endif
 
        // compute C
        cs[i] = ladder::compute<true>
                (g, nonident_arr(arrs[i]),
                 boolean_neighborhood.begin(), L1.begin(), upper_bound);
 
        for (uint64_t z = 0; z < n; ++z) {
            L1[z] = 0;
            boolean_neighborhood[z] = 0;
        }
        L1[n - 1] = 0;
    }
 
    return cs;
}
 
template <class graph_t>
std::vector<uint64_t> is_n_C_ladder_lesseq_than(
    const graph_t& g,
    const std::vector<linear_arrangement>& arrs,
    const std::vector<uint64_t>& upper_bounds
)
noexcept
{
#if defined DEBUG
    // ensure that there are as many linear arrangements as upper bounds
    assert(arrs.size() == upper_bounds.size());
#endif
 
    const uint64_t n = g.get_num_nodes();
 
    std::vector<uint64_t> cs(arrs.size(), 0);
    if (n < 4) { return cs; }
 
    // boolean neighbourhood of nodes
    data_array<unsigned char> boolean_neighborhood(n, 0);
    // array L1 (same as in the pseudocode) ( size n )
    data_array<uint64_t> L1(n, 0);
 
    /* compute C for every linear arrangement */
    for (std::size_t i = 0; i < arrs.size(); ++i) {
#if defined DEBUG
        // ensure that no linear arrangement is empty
        assert(arrs[i].size() == n);
#endif
 
        // compute C
        boolean_neighborhood.fill(0);
 
        cs[i] = ladder::compute<true>
                (g, nonident_arr(arrs[i]),
                 boolean_neighborhood.begin(), L1.begin(), upper_bounds[i]);
 
        for (uint64_t z = 0; z < n; ++z) {
            L1[z] = 0;
            boolean_neighborhood[z] = 0;
        }
        L1[n - 1] = 0;
    }
 
    return cs;
}
 
} // -- namespace crossings
} // -- namespace detail
} // -- namespace lal