\r
\r
/**\r
- * Disposes this node. Removes all the links that connect to thi snode.\r
+ * Disposes this node. Removes all the links that connect to this node.\r
*/\r
public void destroy() {\r
if (disposed)\r
} else {\r
for (int i = 0; i < nodes.size() -1 ; i++) {\r
Link<T> link1 = nodes.get(i);\r
- link1.to().removeLink(link1.getInverseName(), link1.getName(), this);\r
- for (int j = i; j < nodes.size(); j++) {\r
+ link1.to()._removeLink(link1.getInverseName(), link1.getName(), this);\r
+ for (int j = i+1; j < nodes.size(); j++) {\r
Link<T> link2 = nodes.get(j);\r
- link2.to().removeLink(link2.getInverseName(), link2.getName(), this);\r
+ link2.to()._removeLink(link2.getInverseName(), link2.getName(), this);\r
if (link1.to().equals(link2.to()))\r
continue;\r
link1.to().addLink(link1.getInverseName(),link2.getInverseName(),link2.to());\r
}\r
\r
/**\r
- * Disposed the node and all nodes that are in the same graph.\r
+ * Dispose the node and all nodes that are in the same graph.\r
*/\r
public void dispose() {\r
if (disposed)\r
return count;\r
}\r
}\r
+ \r
+ public String toString() {\r
+ return "Node : " + data;\r
+ }\r
}\r