// Graph.cpp

#include <vector>
#include <iostream>

/////////////////////////////////////////////////////////////
// class Node - holds the M-Ary tree's data

template <typename T>
class Node
{
public:
  Node(const T& t);
  void addChild(Node<T>* pNode);
  bool nextChild(Node<T>& n);
  unsigned int size();
private:
  std::vector<T> _children;
};

/////////////////////////////////////////////////////////////
// class Proc
//   interface for processing to be applied to each node

class Proc
{
public:
  virtual ~Proc() {}
  virtual void processNode()=0;
};

/////////////////////////////////////////////////////////////
// class Graph
//   holds onto head node, knows how to search
//   and how to process each node

template <typename T>
class Graph
{
public:
  Graph();
  ~Graph();
  Graph(const Graph<T>& m);
  Graph<T>& operator=(const Graph<T>& m);
  void add(Node<T>& parent, const T& t);  // wraps t in Node
  void makeChild(Node<T>& parent, Node<T>& child);
  void DFS(Proc& p);
  bool find(T& t);
private:
  Node<T>* head;
};

int main()
{
  std::cout << "\n  no member functions implemented\n\n";
}