public int numNodes() {
int numNodes = 0;
BreadthFirstEnumeration<DeLiCluNode, DeLiCluEntry> bfs = new BreadthFirstEnumeration<DeLiCluNode, DeLiCluEntry>(this, getRootPath());
while(bfs.hasMoreElements()) {
Entry entry = bfs.nextElement().getLastPathComponent().getEntry();
if(!entry.isLeafEntry()) {
numNodes++;
}
}
return numNodes;