public String[] findNearestInsertion() {
		
		String edgeMin = null;
		String nodeMin = null;
		int distMin = -1;
		
		for (String node : this.circleNodes) {
			List<String> edges = this.graph.getIncident(node);
			for (String edge : edges) {
				String target = this.getOtherNodeFromEdge(edge, node);
				if (!this.circleNodes.contains(target)) {
					//Node noch nicht im Kreis
					int dist = this.graph.getValE(edge, this.edgeDistAttrName);
					if (edgeMin == null || distMin > dist) {
						edgeMin = edge;
						nodeMin = target;
						distMin = dist;
					}
				}
			}
		}
		
		return new String[]{nodeMin,edgeMin};
	}