| 163 | } |
| 164 | |
| 165 | void |
| 166 | VisualNode::labelBranches(NodeAllocator& na, |
| 167 | BestNode* curBest, int c_d, int a_d) { |
| 168 | bool clear = na.hasLabel(this); |
| 169 | BranchLabelCursor c(this,curBest,c_d,a_d,clear,na); |
| 170 | PreorderNodeVisitor<BranchLabelCursor>(c).run(); |
| 171 | dirtyUp(na); |
| 172 | } |
| 173 | |
| 174 | void |
| 175 | VisualNode::labelPath(NodeAllocator& na, |