abstract_undirected_graph.h

Go to the documentation of this file.

#ifndef GRAPHLIB_INTERNAL_ABSTRACT_UNDIRECTED_GRAPH_H
#define GRAPHLIB_INTERNAL_ABSTRACT_UNDIRECTED_GRAPH_H
 
#include <stdexcept>
 
#include "GraphLib/internal/abstract_graphs/abstract_graph.h"
#include "GraphLib/internal/concepts.h"

 
namespace GraphLib::Internal {

template <valid_data_type D, valid_id_type I, valid_edge_type<I> E>
class UndirectedGraph : public virtual Graph<D, I, E> {
public:
    [[nodiscard]] bool is_directed() const override
    {
        return false;
    }

    void remove_edge(I from_id, I to_id) override
    {
        if (!this->node_exists(from_id)) {
            throw std::invalid_argument("Node with ID from_id does not exist");
        }
        if (!this->node_exists(to_id)) {
            throw std::invalid_argument("Node with ID to_id does not exist");
        }
        if (!this->adj_list_.has_edge(from_id, to_id) || !this->adj_list_.has_edge(to_id, from_id)) {
            throw std::invalid_argument("Nodes don't have an edge");
        }
 
        this->adj_list_.remove_edge(from_id, to_id);
        this->adj_list_.remove_edge(to_id, from_id);
    }
};
 
} // namespace GraphLib::Internal
 
#endif