X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2Futil%2FPrintableTree.java;h=802296d05b1fea0967d19b01dbce741fab93c6d6;hp=ba26a5821bf6b6ebf5542178422b84c3a172494e;hb=24219bdf084b45273e869cd19382d1640b396566;hpb=14b3d2ee6a2d2ef84628e541ec291961f2061a5a

diff --git a/src/edu/berkeley/sbp/util/PrintableTree.java b/src/edu/berkeley/sbp/util/PrintableTree.java
index ba26a58..802296d 100644
--- a/src/edu/berkeley/sbp/util/PrintableTree.java
+++ b/src/edu/berkeley/sbp/util/PrintableTree.java
@@ -87,9 +87,9 @@ public abstract class PrintableTree<T extends PrintableTree> implements Iterable
 
     // this is here to keep it out of the javadoc for Tree<T>
     
-    public GraphViz.Node toGraphViz(GraphViz gv) {
+    public GraphViz.StateNode toGraphViz(GraphViz gv) {
         if (gv.hasNode(this)) return gv.createNode(this);
-        GraphViz.Node n = gv.createNode(this);
+        GraphViz.StateNode n = gv.createNode(this);
         n.label = head()==null ? "" : head().toString();
         for(T t : this) n.edge(t, null);
         return n;