rand_lab_rooted_trees.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 <random>
 
// lal includes
#include <lal/graphs/rooted_tree.hpp>
#include <lal/generate/rand_lab_free_trees.hpp>
 
namespace lal {
namespace generate {
 
class _rand_lab_rooted_trees : public _rand_lab_free_trees {
public:
    /* CONSTRUCTORS */
 
    _rand_lab_rooted_trees(uint32_t n, uint32_t seed = 0) noexcept
        : _rand_lab_free_trees(n, seed) { }
    _rand_lab_rooted_trees(const _rand_lab_rooted_trees& Gen) = default;
#ifndef SWIG
    _rand_lab_rooted_trees(_rand_lab_rooted_trees&& Gen) = default;
#endif
    ~_rand_lab_rooted_trees() = default;
 
    /* GETTERS */
 
    inline graphs::rooted_tree get_tree() noexcept {
        const graphs::free_tree t = _rand_lab_free_trees::get_tree();
        const node r = m_unif(m_gen);
        return graphs::rooted_tree(t, r);
    }
 
protected:
    inline void init(uint32_t seed = 0) noexcept {
        _rand_lab_free_trees::init(seed);
    }
};
 
class rand_lab_rooted_trees : public _tree_generator<graphs::rooted_tree> {
public:
    /* CONSTRUCTORS */
 
    rand_lab_rooted_trees(uint32_t n, uint32_t seed = 0) noexcept
        : _tree_generator<graphs::rooted_tree>(n), m_Gen(n, seed) { }
    rand_lab_rooted_trees(const rand_lab_rooted_trees& Gen) = default;
#ifndef SWIG
    rand_lab_rooted_trees(rand_lab_rooted_trees&& Gen) = default;
#endif
    ~rand_lab_rooted_trees() = default;
 
    inline graphs::rooted_tree yield_tree() noexcept {
        return get_tree();
    }
 
protected:
    inline graphs::rooted_tree __get_tree() noexcept { return m_Gen.get_tree(); }
 
protected:
    _rand_lab_rooted_trees m_Gen;
};
 
} // -- namespace generate
} // -- namespace lal