|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectalgs.debug.DottyDebugger
algs.model.tree.debug.BinaryTreeDebugger
public class BinaryTreeDebugger
Debugging subclass for binary trees.
Field Summary |
---|
Fields inherited from class algs.debug.DottyDebugger |
---|
_ctr, BreadthFirstOrdering, defaultFontName, defaultFontSize, DepthFirstOrdering, discarded, edges, goal, nodes, start, TooLarge, unexplored |
Constructor Summary | |
---|---|
BinaryTreeDebugger()
|
Method Summary | |
---|---|
java.lang.String |
edgeType()
Default to having nodes with complex record shapes. |
void |
visit(BalancedBinaryNode parent,
BalancedBinaryNode n)
Visit a node, and keep in mind its parent. |
void |
visit(BinaryNode parent,
BinaryNode n)
Visit (parent, child) pair by visiting both nodes, then add the edge. |
Methods inherited from class algs.debug.DottyDebugger |
---|
complete, getInputString, getKey, labelEdge, markDiscarded, markEdge, markGoal, markStart, markUnexplored, nodeType, numNodes, ordering, rank, visitEdge, visitEdge, visitNode |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public BinaryTreeDebugger()
Method Detail |
---|
public java.lang.String edgeType()
edgeType
in class DottyDebugger
public void visit(BinaryNode parent, BinaryNode n)
visit
in interface IVisitor
parent
- parent (or null if root) of node being visited.n
- node being visitedpublic void visit(BalancedBinaryNode parent, BalancedBinaryNode n)
IBalancedVisitor
visit
in interface IBalancedVisitor
parent
- parent (or null if root) of node being visited.n
- node being visited
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |