template <class T>
class Node{
public:
Node();
Node(T value, int number);
Node(const Node<T> & n);
~Node();

/// accessor
T getValue()const ;
int getNumber() const;
Node<T> * getNext() const;

// mutators
void setValue(T value) ;
void setNumber(int number);
void setNext(Node<T> * n);

/**
* overloading assignment operator
*/
Node<T> operator=(const Node<T> & n);

/**
* overloading comparing operator
*/
bool operator ==(const Node<T> & n);
private:
T value;
int number;
Node<T> * next; // pointer to the next node in the list
};

template <class T>
Node<T>::Node(){
next = 0;
}

template <class T>
Node<T>::Node(T value, int number){
this->value = value;
this->number = number;
next = 0;
}

template <class T>
Node<T>::Node(const Node<T>& n){
this->value = n.value;
this->number = n.number;
next = 0;
}

template <class T>
Node<T>::~Node(){
next = 0;
}

template <class T>
T Node<T>::getValue() const{
return value;
}

template <class T>
int Node<T>::getNumber() const{
return number;
}

template <class T>
Node<T> * Node<T>::getNext() const {
return next;
}

Assignment 5 - Graphs, pointers and free-store A graph G is a tupl...