import EDU.neu.ccs.demeter.dj.*;
import com.objectspace.jgl.*;
import com.objectspace.jgl.algorithms.*;
import java.util.*;


class Main {
  public static void main(String[] args) {
    ClassGraph cg = new ClassGraph(); // constructed from *.java
    MyVector v = new MyVector();
    v.addElement(new D());
    A a = new A(new B(new D()), new C(),v);

    // cg.traverse(a, new StrategyGraph("A->D"), new MyVisitor());
    Strategy sg = new Strategy("from A to D");
    TraversalGraph tg = TraversalGraph.compute(cg, sg);
    tg.traverse(a, new MyVisitor());
    System.out.println("Traversal Graph for from A to D");
    System.out.println(tg);        

    InputIterator beginDs = tg.start(a);
    InputIterator endDs = tg.finish(a);
    Printing.println(beginDs, endDs);

    Enumeration e = tg.elements(a);
    while (e.hasMoreElements())
      System.out.println(e.nextElement());


  }
}