directed_graph.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
#if defined DEBUG
#include <cassert>
#endif
#include <vector>
 
// lal includes
#include <lal/definitions.hpp>
#include <lal/graphs/graph.hpp>
#include <lal/graphs/undirected_graph.hpp>
 
namespace lal {
namespace graphs {
 
class directed_graph : virtual public graph {
public:
    /* CONSTRUCTORS */
 
    directed_graph() noexcept : graph() { }
    directed_graph(uint32_t n) noexcept {
        init(n);
    }
    directed_graph(const directed_graph& g) noexcept : graph() {
        copy_full_directed_graph(g);
    }
#ifndef SWIG
    directed_graph(directed_graph&& g) noexcept {
        move_full_directed_graph(std::move(g));
    }
#endif
    virtual ~directed_graph() noexcept { }
 
    /* OPERATORS */
 
#ifndef SWIG
    directed_graph& operator= (const directed_graph& g) noexcept {
        copy_full_directed_graph(g);
        return *this;
    }
    directed_graph& operator= (directed_graph&& g) noexcept {
        move_full_directed_graph(std::move(g));
        return *this;
    }
#endif
 
    /* MODIFIERS */
 
    void normalise() noexcept;
 
    bool check_normalised() noexcept;
 
    virtual directed_graph& add_edge
    (node s, node t, bool norm = true, bool check_norm = true) noexcept;
 
    directed_graph& add_edge_bulk(node s, node t) noexcept;
 
    void finish_bulk_add(bool norm = true, bool check = true) noexcept;
 
    virtual directed_graph& add_edges
    (const std::vector<edge>& edges, bool norm = true, bool check_norm = true)
    noexcept;
 
    virtual directed_graph& set_edges
    (const std::vector<edge>& edges, bool norm = true, bool check_norm = true)
    noexcept;
 
    virtual directed_graph& remove_edge
    (node s, node t, bool norm = false, bool check_norm = true) noexcept;
 
    virtual directed_graph& remove_edges
    (const std::vector<edge>& edges, bool norm = true, bool check_norm = true)
    noexcept;
 
    virtual directed_graph& remove_edges_incident_to
    (node u, bool norm = true, bool check_norm = true)
    noexcept;
 
    void disjoint_union(const directed_graph& g) noexcept;
 
    /* SETTERS */
 
    /* GETTERS */
 
    std::vector<edge_pair> get_Q() const noexcept;
 
    std::vector<edge> get_edges() const noexcept;
 
    bool has_edge(node u, node v) const noexcept;
 
    inline const neighbourhood& get_out_neighbours(node u) const noexcept {
#if defined DEBUG
        assert(has_node(u));
#endif
        return m_adjacency_list[u];
    }
    inline const neighbourhood& get_in_neighbours(node u) const noexcept {
#if defined DEBUG
        assert(has_node(u));
#endif
        return m_in_adjacency_list[u];
    }
 
    inline uint32_t get_degree(node u) const noexcept
    { return get_out_degree(u) + get_in_degree(u); }
 
    inline uint32_t get_out_degree(node u) const noexcept {
#if defined DEBUG
        assert(has_node(u));
#endif
        return static_cast<uint32_t>(m_adjacency_list[u].size());
    }
    inline uint32_t get_in_degree(node u) const noexcept {
#if defined DEBUG
        assert(has_node(u));
#endif
        return static_cast<uint32_t>(m_in_adjacency_list[u].size());
    }
 
    inline bool is_directed() const noexcept { return true; }
    inline bool is_undirected() const noexcept { return false; }
 
    undirected_graph to_undirected
    (bool norm = true, bool check = true) const noexcept;
 
protected:
    std::vector<neighbourhood> m_in_adjacency_list;
 
protected:
    virtual void _init(uint32_t n) noexcept;
    virtual void _clear() noexcept;
 
    void copy_full_directed_graph(const directed_graph& d) noexcept;
    void move_full_directed_graph(directed_graph&& d) noexcept;
 
private:
    void remove_single_edge
    (node u, node v, neighbourhood& out_u, neighbourhood& in_v) noexcept;
};
 
} // -- namespace graphs
} // -- namespace lal