priority_queue_stl.cpp

#include <iostream>

using namespace std;

class node{
    private:
    int cost;
    int predecessor;
    bool visited;

public:
    node(){
        this->cost = 0;
        this->predecessor =-1;
        this->visited = false;
    };
    int getCost(){
        return this->cost;
    };
    int getPredecessor(){
        return this->predecessor;
    };
    bool isVisited(){
        return this->visited;
    };
    void setVisited(bool v){
        this->visited = v;
    };
    void setCost(int c){
        this->cost = c;
    };
    void setPredecessor(int p){
        this->predecessor = p;
    };
    bool operator<(const &node a,const &node b){
        return a->getCost()<b->getCost();
    }
};

int main()
{

    return 0;
}