abstract_weighted_graph.h

Go to the documentation of this file.

#ifndef GRAPHLIB_INTERNAL_ABSTRACT_WEIGHTED_GRAPH_H
#define GRAPHLIB_INTERNAL_ABSTRACT_WEIGHTED_GRAPH_H
 
#include "GraphLib/internal/abstract_graphs/abstract_graph.h"
#include "GraphLib/internal/concepts.h"
#include <ostream>

 
namespace GraphLib::Internal {

template <valid_data_type D, valid_id_type I, valid_weighted_edge_type<I> E>
class WeightedGraph : public virtual Graph<D, I, E> {
public:
    [[nodiscard]] bool is_weighted() const override
    {
        return true;
    }

    void add_edge(const I from_id, const I to_id) override
    {
        add_edge(from_id, to_id, typename E::weight_type {});
    }

    void add_edge(const I from_id, const I to_id, const typename E::weight_type weight)
    {
        auto edge = E {};
        edge.node_id = to_id;
        edge.weight = weight;
        this->add_edge_impl(from_id, edge);
    }

    typename E::weight_type get_edge_weight(const I from_id, const I to_id) const
    {
        auto edge = this->get_edge(from_id, to_id);
        return edge.weight;
    }

    typename E::weight_type get_total_weight() const
    {
        typename E::weight_type total_weight {};
 
        for (const auto& from_id : this->get_nodes()) {
            for (const auto& edge : this->get_edges(from_id)) {
                if (this->is_directed() || from_id < edge.node_id) {
                    total_weight += edge.weight;
                }
            }
        }
 
        return total_weight;
    }
};
 
} // namespace GraphLib::Internal
 
#endif