edge.h

Go to the documentation of this file.

#ifndef GRAPHLIB_INTERNAL_EDGE_H
#define GRAPHLIB_INTERNAL_EDGE_H
 
#include <cstddef>
#include <iostream>
#include <ostream>
 
#include "GraphLib/internal/concepts.h"

 
namespace GraphLib::Internal {

template <valid_id_type I>
struct Edge {
public:
    using id_type = I; 
 
    id_type node_id {}; 

    bool operator<(const Edge& right) const
    {
        return node_id < right.node_id;
    }

    bool operator==(const Edge& other) const
    {
        return node_id == other.node_id;
    }

    template <typename D>
        requires GraphLib::Internal::is_printable<D> && GraphLib::Internal::valid_data_type<D>
    void print_with_data(std::ostream& os, D value) const
    {
        os << value;
    }
};

template <valid_id_type I>
std::ostream& operator<<(std::ostream& os, const Edge<I>& edge)
{
    os << edge.node_id;
    return os;
}

template <valid_id_type I, valid_weight_type W>
struct WeightedEdge : public Edge<I> {
public:
    using weight_type = W; 
 
    weight_type weight {}; 

    bool operator<(const WeightedEdge& right) const
    {
        // First check Ids, if they are the same compare weight
        // Maybe change this in Future?
        if (this->node_id == right.node_id) {
            return this->weight < right.weight;
        } else {
            return this->node_id < right.node_id;
        };
    }

    bool operator==(const WeightedEdge& other) const
    {
        return this->node_id == other.node_id && weight == other.weight;
    }

    template <typename D>
        requires GraphLib::Internal::is_printable<D> && GraphLib::Internal::valid_data_type<D>
    void print_with_data(std::ostream& os, D value) const
    {
        os << value << " (" << this->weight << ")";
    }
};

template <valid_id_type I, valid_weight_type W>
std::ostream& operator<<(std::ostream& os, const WeightedEdge<I, W>& edge)
{
    os << edge.node_id << " (" << edge.weight << ")";
    return os;
}
 
} // namespace GraphLib::Internal
 
#endif