List shortEdges = acd.getShortEdges();
if (!(shortEdges.isEmpty())){
Vector shortlyConnectedComponents = new Vector();
Iterator shortIt = shortEdges.iterator();
while (shortIt.hasNext()){
Edge nextEdge = (Edge) shortIt.next();
Node other = nextEdge.getOtherNode(next);
Graph g = getMyComponent(other, connectedComponents);
if (!(shortlyConnectedComponents.contains(g))){
shortlyConnectedComponents.add(g);
}
}
Graph cv = null;
if (shortlyConnectedComponents.size() > 1){
Iterator sccIt = shortlyConnectedComponents.iterator();
int maxSize = 0;
while (sccIt.hasNext()){
Graph nextGraph = (Graph) sccIt.next();
int size = nextGraph.getNodes().size();
if (size > maxSize){
maxSize = size;
cv = nextGraph;
}
}
} else {
cv = (Graph) shortlyConnectedComponents.get(0);
}
Iterator shortIt2 = shortEdges.iterator();
while (shortIt2.hasNext()){
Edge nextEdge = (Edge) shortIt2.next();
Node other = nextEdge.getOtherNode(next);
if (cv.equals(getMyComponent(other, shortlyConnectedComponents))){
edges.add(nextEdge);
}
}
} //end if shortEdges isn't empty
Graph gr = getMyComponent(next, connectedComponents);
if (gr.getNodes().size() == 1){
Vector shortlyConnectedComponents = new Vector();
Iterator shortIt = shortEdges.iterator();
while (shortIt.hasNext()){
Edge nextEdge = (Edge) shortIt.next();
Node other = nextEdge.getOtherNode(next);
Graph g = getMyComponent(other, connectedComponents);
if (!(shortlyConnectedComponents.contains(g))){
shortlyConnectedComponents.add(g);
}
}
if (shortlyConnectedComponents.size() == 1){
edges.addAll(shortEdges);
}
}
} //end nodeIt4 while loop.
LOGGER.fine("End of phase two and ");
LOGGER.fine("Nodes are " + nodes);
LOGGER.fine("Edges are " + edges);
showGraph(nodes, edges, 2);
connectedComponents = AutoClustUtils.findConnectedComponents(nodes, edges);
//Phase III
Iterator nodeIt5 = nodes.iterator();
while (nodeIt5.hasNext()){
DelaunayNode next = (DelaunayNode) nodeIt5.next();
Vector edgesWithinTwo = new Vector();
List adjacentEdges = AutoClustUtils.findAdjacentEdges(next, edges); //yes, next.getEdges() could work, but there's no guarantee that next's edge list is current anymore
edgesWithinTwo.addAll(adjacentEdges);
Iterator adjacentIt = adjacentEdges.iterator();
while (adjacentIt.hasNext()){
Edge nextEdge = (Edge) adjacentIt.next();
Node other = nextEdge.getOtherNode(next);
List adjacentToOther = AutoClustUtils.findAdjacentEdges(other, edges); //yes, other.getEdges() could work, but there's no guarantee that other's edge list is current anymore
Iterator atoIt = adjacentToOther.iterator();
while (atoIt.hasNext()){
Edge nextEdge2 = (Edge) atoIt.next();
if (!(edgesWithinTwo.contains(nextEdge2))){
edgesWithinTwo.add(nextEdge2);
}
}
}