return elements;
return myElements;
  private Vector getRelatedElements(Vector elements, String relationship) {    for (int i = 0; i < elements.size(); i++) {      Element element = (Element)elements.elementAt(i);      // remove any subgraphs (in particular the whole graph)      if (element instanceof Subgraph) {	elements.remove(i--);	continue;      }      // remove edges, as we only want the ones that match relationship      if (element instanceof Edge) {	elements.remove(i--);	continue;      }    }    for (int i = 0; i < elements.size(); i++) {      Element element = (Element)elements.elementAt(i);      if (!(element instanceof Node))	continue;      Node node = (Node)element;      Vector otherNodeNames = 	getAttributeValuesWithSuffix(node, relationship);      Enumeration edges = node.edgeElements();      while (edges.hasMoreElements()) {	Edge edge = (Edge)edges.nextElement();	if (edge.getHead().equals(node)) {	  if (otherNodeNames.contains(getOrganizationName(edge.getTail()))) {	    if (!elements.contains(edge))	      elements.add(edge);	    Node tail = edge.getTail();	    if (!elements.contains(tail))	      elements.add(tail);	  }	} else if (edge.getTail().equals(node)) {	  if (otherNodeNames.contains(getOrganizationName(edge.getHead()))) {	    if (!elements.contains(edge)) 	      elements.add(edge);	    Node head = edge.getHead();	    if (!elements.contains(head)) 	      elements.add(head);	  }	}      }    }    return elements;  }