projects
/
sbp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
refactor predecessor/successor into Node class
[sbp.git]
/
src
/
edu
/
berkeley
/
sbp
/
util
/
PrintableTree.java
diff --git
a/src/edu/berkeley/sbp/util/PrintableTree.java
b/src/edu/berkeley/sbp/util/PrintableTree.java
index
bbc1ab9
..
802296d
100644
(file)
--- a/
src/edu/berkeley/sbp/util/PrintableTree.java
+++ b/
src/edu/berkeley/sbp/util/PrintableTree.java
@@
-1,4
+1,4
@@
-// Copyright 2006 all rights reserved; see LICENSE file for BSD-style license
+// Copyright 2006-2007 all rights reserved; see LICENSE file for BSD-style license
package edu.berkeley.sbp.util;
import edu.berkeley.sbp.*;
package edu.berkeley.sbp.util;
import edu.berkeley.sbp.*;
@@
-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>
// 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);
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;
n.label = head()==null ? "" : head().toString();
for(T t : this) n.edge(t, null);
return n;