return null;
if (dirty) update();   NodeRecord best = null; NodeRecord r; Enumeration en = nodes.elements();  int dist = Integer.MAX_VALUE;  while (en.hasMoreElements() && dist > 0) { r = (NodeRecord) en.nextElement(); if (best == null) { best = r; dist = distance(r.getBounds(), x, y); } else { int rr = distance(r.getBounds(), x, y); if (rr < dist) { best = r; dist = rr; } } }  if (best == null) return null; else return best.getPath();
  public TreePath getPathClosestTo(int value0, int value1)     throws NotImplementedException  {		return null; // TODO  } 