Queues.h

#ifndef QUEUES_H
#define QUEUES_H

#include <list>
#include <vector>
#include <unordered_set>

#include "node.h"

class iOpen {
protected:
    virtual bool less(const Node &x, const Node &y) const;
    int breaking_tie;
public:
    iOpen() {};

    virtual bool Insert(const Node &NewNode) = 0;

    virtual Node FindMin() const = 0;

    virtual void DeleteMin() = 0;

    virtual size_t size() const = 0;

    virtual bool empty() const = 0;
};

class SortedList : public iOpen {
private:
    std::vector<std::list<Node>> data;
    size_t size_;

    mutable size_t min_pos;

public:
    SortedList() = default;

    SortedList(size_t size, int brakingtie);

    virtual bool Insert(const Node &NewNode);

    virtual Node FindMin() const;

    virtual void DeleteMin();

    virtual size_t size() const;

    virtual bool empty() const;
};

class ClusteredSets : public iOpen {
private:
    std::vector<Node> loc_mins;
    std::vector<std::unordered_set<Node>> data;
    size_t size_;
    mutable size_t min_pos;

public:
    ClusteredSets() = default;

    ClusteredSets(size_t size, int breakingtie);

    virtual bool Insert(const Node &NewNode);

    virtual Node FindMin() const;

    virtual void DeleteMin();

    virtual size_t size() const;

    virtual bool empty() const;
};

#endif