X-Git-Url: http://git.megacz.com/?p=sbp.git;a=blobdiff_plain;f=src%2Fedu%2Fberkeley%2Fsbp%2FForest.java;h=cdf8a8b634784b7c40ae2c5cce62e0e716d0764d;hp=645850b00c397339ed658b306abcacb680967eb6;hb=0e17670bcfa7b0fe8eb3a2cac81f4b080a09fc98;hpb=9b7ce1d3e4ac84ecd2d0f5f461b42c40f38e4783

diff --git a/src/edu/berkeley/sbp/Forest.java b/src/edu/berkeley/sbp/Forest.java
index 645850b..cdf8a8b 100644
--- a/src/edu/berkeley/sbp/Forest.java
+++ b/src/edu/berkeley/sbp/Forest.java
@@ -7,8 +7,10 @@ import java.util.*;
 import java.lang.reflect.*;
 
 /**
+ *   <font color=blue>
  *   An efficient representation of a collection of trees (Tomita's
  *   shared packed parse forest).
+ *   </font>
  */
 public abstract class Forest<T> implements GraphViz.ToGraphViz {
 
@@ -27,10 +29,9 @@ public abstract class Forest<T> implements GraphViz.ToGraphViz {
 
     abstract void expand(HashSet<Tree<T>> ht, HashSet<Forest<T>> ignore, Tree<T> bogus);
     abstract void gather(HashSet<Forest<T>> ignore);
+    abstract void edges(GraphViz.Node n);
     boolean ambiguous() { return false; }
 
-    public abstract void edges(GraphViz.Node n);
-
 
     // One //////////////////////////////////////////////////////////////////////////////