C.hpp

/*********************************************************************
 *
 *  Linear Arrangement Library - A library that implements a collection
 *  algorithms for linear arrangments of graphs.
 *
 *  Copyright (C) 2019 - 2021
 *
 *  This file is part of Linear Arrangement Library. To see the full code
 *  visit the webpage:
 *      https://github.com/lluisalemanypuig/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/
 *
 ********************************************************************/
 
#pragma once
 
// C++ includes
#include <vector>
 
// lal includes
#include <lal/definitions.hpp>
#include <lal/graphs/directed_graph.hpp>
#include <lal/graphs/undirected_graph.hpp>
#include <lal/linarr/algorithms_C.hpp>
#include <lal/numeric/rational.hpp>
 
namespace lal {
namespace linarr {
 
uint32_t num_crossings(
    const graphs::directed_graph& G,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
uint32_t num_crossings(
    const graphs::undirected_graph& G,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
uint32_t num_crossings(
    const graphs::directed_graph& G,
    const linear_arrangement& pi,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
uint32_t num_crossings(
    const graphs::undirected_graph& G,
    const linear_arrangement& pi,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
std::vector<uint32_t> num_crossings_list(
    const graphs::directed_graph& G,
    const std::vector<linear_arrangement>& pis,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
std::vector<uint32_t> num_crossings_list(
    const graphs::undirected_graph& G,
    const std::vector<linear_arrangement>& pis,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
uint32_t is_num_crossings_lesseq_than(
    const graphs::directed_graph& G,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
uint32_t is_num_crossings_lesseq_than(
    const graphs::undirected_graph& G,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
uint32_t is_num_crossings_lesseq_than(
    const graphs::directed_graph& G,
    const linear_arrangement& pi,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
uint32_t is_num_crossings_lesseq_than(
    const graphs::undirected_graph& G,
    const linear_arrangement& pi,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
std::vector<uint32_t> is_num_crossings_lesseq_than_list(
    const graphs::directed_graph& G,
    const std::vector<linear_arrangement>& pis,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
std::vector<uint32_t> is_num_crossings_lesseq_than_list(
    const graphs::undirected_graph& G,
    const std::vector<linear_arrangement>& pis,
    uint32_t upper_bound,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
std::vector<uint32_t> is_num_crossings_lesseq_than_list(
    const graphs::directed_graph& G,
    const std::vector<linear_arrangement>& pis,
    const std::vector<uint32_t>& upper_bounds,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
std::vector<uint32_t> is_num_crossings_lesseq_than_list(
    const graphs::undirected_graph& G,
    const std::vector<linear_arrangement>& pis,
    const std::vector<uint32_t>& upper_bounds,
    const algorithms_C& A = algorithms_C::ladder
) noexcept;
 
/* ---------------------------------------- */
/* APPROXIMATION OF THE NUMBER OF CROSSINGS */
 
numeric::rational predicted_num_crossings_rational
(const graphs::undirected_graph& g, const linear_arrangement& pi = {}) noexcept;
 
numeric::rational predicted_num_crossings_rational
(const graphs::directed_graph& g, const linear_arrangement& pi = {}) noexcept;
 
double predicted_num_crossings
(const graphs::undirected_graph& g, const linear_arrangement& pi = {}) noexcept;
 
double predicted_num_crossings
(const graphs::directed_graph& g, const linear_arrangement& pi = {}) noexcept;
 
} // -- namespace linarr
} // -- namespace lal