all_projective_arrangements.hpp

/*********************************************************************
 *
 * Linear Arrangement Library - A library that implements a collection
 * algorithms for linear arrangments of graphs.
 *
 * Copyright (C) 2019 - 2024
 *
 * 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 (lluis.alemany.puig@upc.edu)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         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)
 *         LQMC (Quantitative, Mathematical, and Computational Linguisitcs)
 *         CQL (Complexity and Quantitative Linguistics Lab)
 *         Office 220, Omega building
 *         Jordi Girona St 1-3, Campus Nord UPC, 08034 Barcelona.   CATALONIA, SPAIN
 *         Webpage: https://cqllab.upc.edu/people/rferrericancho/
 *
 ********************************************************************/
 
#pragma once
 
// lal includes
#include <lal/linear_arrangement.hpp>
#include <lal/graphs/rooted_tree.hpp>
#include <lal/graphs/free_tree.hpp>
#include <lal/detail/array.hpp>
 
namespace lal {
namespace generate {
 
class all_projective_arrangements {
public:
    /* CONSTRUCTORS */
 
    all_projective_arrangements(const graphs::rooted_tree& T) noexcept;
    all_projective_arrangements(const graphs::free_tree& T, const node root) noexcept
        : all_projective_arrangements(graphs::rooted_tree(T, root))
    { }
 
    all_projective_arrangements(const all_projective_arrangements& Gen) noexcept = default;
    all_projective_arrangements(all_projective_arrangements&& Gen) noexcept = default;
 
    ~all_projective_arrangements() noexcept = default;
 
    /* GETTERS */
 
    [[nodiscard]] bool end() const noexcept { return m_reached_end; };
 
    [[nodiscard]] linear_arrangement get_arrangement() const noexcept;
 
    /* MODIFIERS */
 
    void next() noexcept;
 
    void reset() noexcept;
 
    [[nodiscard]] linear_arrangement yield_arrangement() noexcept {
        const linear_arrangement arr = get_arrangement();
        next();
        return arr;
    }
 
private:
    const graphs::rooted_tree& m_rT;
    detail::array<detail::array<node>> m_intervals;
    bool m_reached_end = false;
 
private:
    void initialize_intervals_tree() noexcept;
    void initialize_interval_node(const node u) noexcept;
};
 
} // -- namespace generate
} // -- namespace lal