private final LinkedList border = new LinkedList();
private final LinkedList edges = new LinkedList();
+
public Subgraph() {
}
}
- public boolean allNodesStillInCompleteGraph() {
+ public boolean allNodesAndBorderStillInCompleteGraph() {
for( Iterator i = nodes.iterator(); i.hasNext(); ) {
Node node = (Node) i.next();
if( !node.inGraph ) {
return false;
}
}
+ for( Iterator i = border.iterator(); i.hasNext(); ) {
+ Node node = (Node) i.next();
+ if( !node.inGraph ) {
+ return false;
+ }
+ }
return true;
}