private void recurseSelectEdges(TreeVertex root) {
Vector edges = root.getEdgeList();
for (int i = 0; i < edges.size(); i++) {
TreeEdge edge = (TreeEdge) edges.elementAt(i);
TreeVertex dest = edge.getDestVertex();
if (m_vertexList.contains(dest)) {
edge.setSelected(true);
recurseSelectEdges(dest);
}
}
}
/*
* Creates a line of width EDGE_SELECT_WIDTH for each edge
* and tests if mouse click was in that Shape's boundary.
* Returns the edge if one was selected, null otherwise.
*/
public TreeEdge testEdgeShapes(MouseEvent event) {
if (argument == null || argument.getTree() == null) return null;
double x = event.getX();
double y = event.getY();
BasicStroke edgeWidth = new BasicStroke(EDGE_SELECT_WIDTH);
if (argument.getBreadthFirstTraversal() == null) return null;
Enumeration nodeList = argument.getBreadthFirstTraversal().elements();
while (nodeList.hasMoreElements()) {
TreeVertex vertex = (TreeVertex) nodeList.nextElement();
if (argument.isMultiRoots() && vertex.getLayer() == 0) continue;
Enumeration edges = vertex.getEdgeList().elements();
while (edges.hasMoreElements()) {
TreeEdge edge = (TreeEdge) edges.nextElement();
Shape shape = edge.getShape(this);
Shape wideEdge = edgeWidth.createStrokedShape(shape);
TreeVertex child = edge.getDestVertex();
if (wideEdge.contains(x, y)) {
edge.setSelected(!edge.isSelected());
return edge;
}
}
}
return null;
}