edge_list.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 <optional>
#include <string>
 
// 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 io {
 
// **DEVELOPER NOTE**
// These functions were not implemented as a templated function in this header
// file so as to avoid including <filesystem> and <ifstream> in this header.
 
// **DEVELOPER NOTE**
// These function's documentation has to be updated manually in the io.i
// interface file.
 
std::optional<graphs::undirected_graph>
read_edge_list_undirected_graph
(const std::string& filename, bool norm = true, bool check_norm = true)
noexcept;
 
std::optional<graphs::directed_graph>
read_edge_list_directed_graph
(const std::string& filename, bool norm = true, bool check_norm = true)
noexcept;
 
std::optional<graphs::free_tree>
read_edge_list_free_tree
(const std::string& filename, bool norm = true, bool check_norm = true)
noexcept;
 
std::optional<graphs::rooted_tree>
read_edge_list_rooted_tree
(const std::string& filename, bool norm = true, bool check_norm = true)
noexcept;
 
template<
    class G,
    std::enable_if_t<std::is_base_of_v<graphs::graph, G>, bool> = true
>
std::optional<G>
read_edge_list
(const std::string& filename, bool norm = true, bool check_norm = true)
noexcept
{
    if constexpr (std::is_base_of_v<graphs::free_tree, G>) {
        return read_edge_list_free_tree(filename, norm, check_norm);
    }
    else if constexpr (std::is_base_of_v<graphs::rooted_tree, G>) {
        return read_edge_list_rooted_tree(filename, norm, check_norm);
    }
    else if constexpr (std::is_base_of_v<graphs::undirected_graph, G>) {
        return read_edge_list_undirected_graph(filename, norm, check_norm);
    }
    else if constexpr (std::is_base_of_v<graphs::directed_graph, G>) {
        return read_edge_list_directed_graph(filename, norm, check_norm);
    }
}
 
} // -- namespace io
} // -- namespace lal