import EDU.neu.ccs.demeter.dj.*;

class Main {
  public static void main(String[] args) {
    System.out.println(TraversalGraph.version());
    ClassGraph cg = new ClassGraph(); // constructed from *.java
    A a = new A(new B(new D()), new C(), new D());
    Strategy sg = new Strategy("from A to D");
    TraversalGraph tg = TraversalGraph.compute(cg, sg);
    tg.traverse(a, new MyVisitor());
    System.out.println("count for {A->D} " + a.count(tg));
  }
}