当我的程序遇到集合的 for 时,我有这个 printStackTrace
Exception in thread "main" java.util.NoSuchElementException: No next element
at positionalList.NodePositionList$IteratorList.next(NodePositionList.java:177)
at positionalList.NodePositionList$IteratorList.next(NodePositionList.java:1)
at positionalList.Ricerca.DFS(Ricerca.java:130)
at positionalList.Ricerca.main(Ricerca.java:291)
我编写了自己的迭代器,并使用了一个头节点和一个尾节点(它们的 Key 设置为 null)来轻松找到列表的开头和结尾。这个类在 NodePositionList 类里面,在包 positionalList 中
private class IteratorList<T> implements Iterator<K> {
protected NodePositionList<K> npl;
protected Position<K> p;
@SuppressWarnings("unused")
public IteratorList(NodePositionList<K> n) {
this.npl = n;
Position<K> p = (npl.isEmpty()) ? null : npl.first();
}
@Override
public boolean hasNext() {
return p != tail;
}
@Override
public K next() throws NoSuchElementException {
if (p == null) {
throw new NoSuchElementException("No next element");
}
K toReturn = p.element();
p = (p == npl.getTail()) ? null : npl.next(p);
return toReturn;
}
@Override
public void remove() {
if (p == null) {
throw new NoSuchElementException("No element to remove");
}
p = npl.remove(p);
}
}
我用这个代码调用它,它属于包“algoritmo”。
public static <T extends Comparable<T>> void DFS(TDAGraph<T> g) {
for (Vertex<T> v: g.vertices()) {
if (v.getColor() == VertexColor.WHITE) {
DFS_visit(g,v);
}
}
}