conversions.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 <algorithm>
#include <vector>
 
// lal includes
#include <lal/graphs/undirected_graph.hpp>
#include <lal/graphs/directed_graph.hpp>
#include <lal/graphs/free_tree.hpp>
#include <lal/graphs/rooted_tree.hpp>
 
namespace lal {
namespace graphs {
 
// -----------------------------------------------------------------------------
// head vector -> tree
 
std::pair<free_tree,node> from_head_vector_to_free_tree
(const head_vector& hv, bool normalise = true, bool check = true)
noexcept;
 
rooted_tree from_head_vector_to_rooted_tree
(const head_vector& hv, bool normalise = true, bool check = true)
noexcept;
 
// -----------------------------------------------------------------------------
// edge list -> graph
 
template<class G>
G from_edge_list_to_graph
(const std::vector<edge>& edge_list, bool normalise = true, bool check = true)
noexcept
{
    uint32_t max_vertex_index = 0;
    for (const edge& e : edge_list) {
        max_vertex_index = std::max(max_vertex_index, e.first);
        max_vertex_index = std::max(max_vertex_index, e.second);
    }
    const uint32_t num_nodes = 1 + max_vertex_index;
    G g(num_nodes);
    g.set_edges(edge_list, normalise, check);
    return g;
}
 
inline rooted_tree from_edge_list_to_rooted_tree
(const std::vector<edge>& edge_list, bool normalise = true, bool check = true)
noexcept
{
    return from_edge_list_to_graph<rooted_tree>(edge_list, normalise, check);
}
 
inline free_tree from_edge_list_to_free_tree
(const std::vector<edge>& edge_list, bool normalise = true, bool check = true)
noexcept
{
    return from_edge_list_to_graph<free_tree>(edge_list, normalise, check);
}
 
inline directed_graph from_edge_list_to_directed_graph
(const std::vector<edge>& edge_list, bool normalise = true, bool check = true)
noexcept
{
    return from_edge_list_to_graph<directed_graph>(edge_list, normalise, check);
}
 
inline undirected_graph from_edge_list_to_undirected_graph
(const std::vector<edge>& edge_list, bool normalise = true, bool check = true)
noexcept
{
    return from_edge_list_to_graph<undirected_graph>(edge_list, normalise, check);
}
 
} // -- namespace graphs
} // -- namespace lal