Class graph
A = <b> B <c> C extends java.lang.Object.
B = <d> D extends java.lang.Object.
java.lang.Object : B | C | A | D | E | X | F | Main | edu.neu.ccs.demeter.dj.Visitor common .
C = extends java.lang.Object.
D = <e> E <x> X extends java.lang.Object.
E = <f> F extends java.lang.Object.
X = <f> F extends java.lang.Object.
F = <i> int extends java.lang.Object.
int = .
Main = extends java.lang.Object.
edu.neu.ccs.demeter.dj.Visitor : MyVisitor common extends java.lang.Object.
MyVisitor = extends edu.neu.ccs.demeter.dj.Visitor.
java.util.Collection = <elements> java.lang.Object.
edu.neu.ccs.demeter.dj.Collection = <elements> java.lang.Object.
End of Class graph
begin
before A
before B
before D
after D
after B
after A
end
 found 1
Traversal Graph for from A to F
Copy 0:
 Nodes:
 A
 B
 java.lang.Object
 D
 Edges:
 -> A,b,B
 -> B,d,D
 Edges to other copies:
 1: -> D,x,X
Copy 1:
 Nodes:
 java.lang.Object
 F
 X
 Edges:
 -> X,f,F
 Edges to other copies: