Node.h

#pragma once
#include "EdgeEntry.h"
#include <stdlib.h>
#include <stdio.h>
#include <assert.h>
#include <iostream>
#include <math.h>

using namespace std;

//The node class represents a node in the graph
//It holds all the relevant node paramaters (label, edge list)
class Node
{
public:
	Node();

	bool operator> (const Node* node) const;
	bool operator< (const Node* node) const;
	int getDegree() { return degree; }
	void setDegree(int deg) { degree = deg; }
	int getLabel() { return label; }
	void setLabel(int lab) { label = lab; }
	int getExcess() { return excess; }
	void setExcess(int exc) { excess = exc; }
	void incExcess(int value) { excess += value; }
	void decExcess(int value);
	int getID() {return id; }
	void setID(int node_id) { id = node_id; }
	EdgeEntry* getAdjList() { return adjList; }
	EdgeEntry* getLastEdge() { return lastEdge; }
	void incNumEdges() { numEdges++; }
	int getNumEdges() { return numEdges; };

	void addEdge(EdgeEntry* edge);
	void printNode(ofstream & output);
	void debugNodeDump();

private :
	int degree;
    int label;
	int excess;
	int id;
	int numEdges;

    EdgeEntry *adjList;
	EdgeEntry *lastEdge;
};