#include <iostream>
#include <sstream>
#include <cctype>
using namespace std;
 
struct node {
  string name;
  int    age;
  node*  next;
  };
 
node *get_list() {
  node *first = NULL;
  node *current;
  string name, s;
  do {
    cout << "Enter a name: ";
    getline( cin, name );
    cout << "Enter " << name << "'s age: ";
    getline( cin, s );
 
    if (first == NULL) first = current = new node;
    else {
      current = current->next = new node;  // pay attention here!
      current->next = NULL;
      }
    current->name = name;
    if (!(stringstream( s ) >> current->age)) current->age = 0;
 
    cout << "More (y/n)? ";
    getline( cin, s );
  } while (toupper( s[ 0 ] ) != 'N');
 
  return first;
  }
 
void print_oldest( node *list ) {
  node *oldest = list;
  for (; list != NULL; list = list->next)
    if (list->age > oldest->age) oldest = list;
  if (oldest != NULL)
    cout << oldest->name << " is the oldest.\n";
  }
 
node *delete_list( node *list ) {
  node *n;
  while (list != NULL) {
    n = list;
    list = list->next;
    delete n;
    }
  return NULL;
  }
 
int main() {
  node *list = get_list();
  print_oldest( list );
  list = delete_list( list );
  }

template <typename T>
class Graph {
 
      public:
             explicit Graph ( int size ) : SIZE (size), datar( new SinglyLinkedList<T> [size] ) {}
             ~Graph() { delete [] datar; }
             Node<T> *find(T);
             bool AddVertex(T);
             bool AddEdge(T, T);
             Node<T>* getList (int);
 
      private:
              const int SIZE;
              SinglyLinkedList<T> * datar;
 
              };

template <typename T>
Graph<T> *get_data() {
  Graph<T> *result = new Graph<T>;
  // fill graph from file here
  return result;
  }