} else {
} else if (siblings.size() == 1) {
	public IFigure getNextFocusableFigureInSameOrder(IFigure root, IFigure focusOwner) {		boolean found = false;		IFigure nextFocusOwner = focusOwner;				/* If no Figure currently has focus,		 * apply focus to root figure's first focusable child		 */		if (focusOwner == null) {			if (root.getChildren().size() != 0) {				nextFocusOwner = ((IFigure)root.getChildren().get(0));				if (isFocusEligible(nextFocusOwner))					return nextFocusOwner;			} else				return null;		}		while (!found) {			IFigure parent = nextFocusOwner.getParent();						/*			 * Figure traversal is implemented using the pre-order left to right			 * tree traversal algorithm.			 *  			 * If the focused sibling has children, traverse to its leftmost child.			 * If the focused sibling has no children, traverse to the sibling			 * to its right.			 * If there is no sibling to the right, go up the tree until a node			 * with untraversed siblings is found.			 */			List siblings = parent.getChildren();			int siblingPos = siblings.indexOf(nextFocusOwner);					if (siblingPos < siblings.size() - 1) {				nextFocusOwner = ((IFigure)(siblings.get(siblingPos + 1)));				if (isFocusEligible(nextFocusOwner))					found = true;			} else {				nextFocusOwner = ((IFigure)(siblings.get(0)));				if (isFocusEligible(nextFocusOwner))					found = true;							}				}		return nextFocusOwner;	}