#ifndef NODE_H
#define NODE_H
class node
{
    private:
    int l;
	int cw; 
	int cp;
    double b;
//Deitel 747, http://www.ces.clemson.edu/~petersj/Agents/BasicVoidGraphs/node71.html
    public:
    node();
    node(const node&);
    node(int, int, int, double);
    ~node();  
	void deleteAllValues();
//operators for to compare in the Prioirty Queue
    int operator<(const node&) const;
    int operator>(const node&) const;
    int operator<=(const node&) const;
    int operator>=(const node&) const;
    int operator==(const node&) const;
    int operator!=(const node&) const;
    void setBound(double bound)  
	{
		b = bound;
	}
    const double getBound()         
	{
		return b;  
	} 
    const int getLevel()           
	{
		return l;  
	} 
    void setLevel(int level)
    {
		l = level;
	}
    void setWeights(int weights)
	{
		cw = weights;
	}
    const int getWeights()           
	{
		return cw; 
	}
    void setProfits(int profits)    
	{
		cp = profits;
	}
    const int getProfits()           
	{
		return cp; 
	}  
}; 
#endif