full_labeled_set_digraph.h

/*
 * Copyright 2026 Michele Comparini
 *
 * SPDX-License-Identifier: Apache-2.0
 */
 
#ifndef GRAPHDOM_FULL_LABELED_SET_DIGRAPH_H
#define GRAPHDOM_FULL_LABELED_SET_DIGRAPH_H
 
#include <set>
 
#include "labeled_vertex_graph.h"
#include "labeled_vertex_set_graph.h"
#include "labeled_edge_graph.h"
#include "labeled_edge_non_mixed_graph.h"
 
namespace graphdom {
    template<
        typename VertexType,
        typename VertexLabelType,
        typename EdgeLabelType,
        typename Compare = std::less<VertexType>,
        typename VertexLabellerType = default_vertex_labeller<VertexType,VertexLabelType>,
        typename EdgeLabellerType = default_edge_labeller<VertexType,EdgeLabelType>
    >
    class full_labeled_set_digraph final :
    virtual public labeled_vertex_set_graph<VertexType,VertexLabelType,VertexLabellerType>,
    virtual public labeled_edge_non_mixed_graph<VertexType,EdgeLabelType,EdgeLabellerType> {
        public:
            full_labeled_set_digraph() = default;
            full_labeled_set_digraph(const Compare& v_comp, const VertexLabellerType& v_lab, const EdgeLabellerType& e_lab);
            full_labeled_set_digraph(const Compare& v_comp, const VertexLabellerType& v_lab, EdgeLabellerType&& e_lab = EdgeLabellerType());
            full_labeled_set_digraph(const Compare& v_comp, VertexLabellerType&& v_lab, const EdgeLabellerType& e_lab);
            explicit full_labeled_set_digraph(const Compare& v_comp, VertexLabellerType&& v_lab = VertexLabellerType(), EdgeLabellerType&& e_lab = EdgeLabellerType());
            full_labeled_set_digraph(Compare&& v_comp, const VertexLabellerType& v_lab, const EdgeLabellerType& e_lab);
            full_labeled_set_digraph(Compare&& v_comp, const VertexLabellerType& v_lab, EdgeLabellerType&& e_lab = EdgeLabellerType());
            full_labeled_set_digraph(Compare&& v_comp, VertexLabellerType&& v_lab, const EdgeLabellerType& e_lab);
            explicit full_labeled_set_digraph(Compare&& v_comp, VertexLabellerType&& v_lab = VertexLabellerType(), EdgeLabellerType&& e_lab = EdgeLabellerType());
 
            ~full_labeled_set_digraph() override;

            [[nodiscard]] std::size_t order() const override;
            [[nodiscard]] const VertexLabelType& get_vertex_label(const typename graph<VertexType>::vertex_const_handle& vertex) const override;
            [[nodiscard]] const EdgeLabelType& get_edge_label(const typename graph<VertexType>::adj_list_const_iterator&) const override;

            void erase_vertex(const typename graphdom::graph<VertexType>::vertex_const_handle& vertex) override;
            [[nodiscard]] typename graphdom::graph<VertexType>::adj_list_iterator erase_edge(const typename graph<VertexType>::adj_list_const_iterator&) override;
            [[nodiscard]] VertexLabelType& get_vertex_label(const typename graph<VertexType>::vertex_const_handle& vertex) override;
            using graphdom::labeled_vertex_set_graph<VertexType,VertexLabelType,VertexLabellerType>::insert_vertex;
            [[nodiscard]] std::pair<typename graph<VertexType>::vertex_handle,bool> insert_vertex(const VertexType& v_core, const VertexLabelType& vertex_label) override;
            [[nodiscard]] std::pair<typename graph<VertexType>::vertex_handle,bool> insert_vertex(const VertexType& v_core, VertexLabelType&& vertex_label) override;
            [[nodiscard]] std::pair<typename graph<VertexType>::vertex_handle,bool> insert_vertex(VertexType&& v_core, const VertexLabelType& vertex_label) override;
            [[nodiscard]] std::pair<typename graph<VertexType>::vertex_handle,bool> insert_vertex(VertexType&& v_core, VertexLabelType&& vertex_label) override;
            [[nodiscard]] EdgeLabelType& get_edge_label(const typename graph<VertexType>::adj_list_const_iterator&) override;
            using graphdom::labeled_edge_non_mixed_graph<VertexType,EdgeLabelType,EdgeLabellerType>::insert_edge;
            void insert_edge(const typename graph<VertexType>::vertex_const_handle& tail, const typename graph<VertexType>::vertex_const_handle& head, const EdgeLabelType& edge_label) override;
            void insert_edge(const typename graph<VertexType>::vertex_const_handle& tail, const typename graph<VertexType>::vertex_const_handle& head, EdgeLabelType&& edge_label) override;
        private:
            using VertexContainerPointerType = typename graphdom::set_graph<VertexType>::VertexContainerPointerType;
            using edge_endpoint = typename graphdom::set_graph<VertexType>::template labeled_directed_edge_endpoint<EdgeLabelType>;
            using adj_set = typename graphdom::set_graph<VertexType>::adj_set;
            using vertex_container = typename graphdom::set_graph<VertexType>::template non_mixed_graph_labeled_vertex_container<VertexLabelType>;
 
            static void safe_edge_endpoint_deallocation(typename graphdom::graph<VertexType>::template edge_endpoint<VertexContainerPointerType>*);
 
            class custom_vertices_set_compare {
                public:
                    custom_vertices_set_compare() = default;
                    explicit custom_vertices_set_compare(const Compare& comp) : external_vertex_less_functor(comp){}
                    explicit custom_vertices_set_compare(Compare&& comp) : external_vertex_less_functor(std::move(comp)){}
 
                    bool constexpr operator()(
                        const vertex_container& left,
                        const vertex_container& right ) const {
                        return external_vertex_less_functor(left.vertex,right.vertex);
                    }
 
                    using is_transparent = void;
 
                    bool constexpr operator()(
                        const vertex_container& left,
                        const VertexType& right ) const {
                        return external_vertex_less_functor(left.vertex,right);
                    }
 
                    bool constexpr operator()(
                        const VertexType& left,
                        const vertex_container& right ) const {
                        return external_vertex_less_functor(left,right.vertex);
                    }
                private:
                    Compare external_vertex_less_functor;
            };
 
            std::set<
                vertex_container,
                custom_vertices_set_compare
            > vertices;
    };
}
 
#include "impl/full_labeled_set_digraph.h"
 
#endif //GRAPHDOM_FULL_LABELED_SET_DIGRAPH_H