edu.ucla.belief.recursiveconditioning
Class RCIteratorTraversal
Object
RCIterator
RCIteratorTraversal
- All Implemented Interfaces:
- Iterator
public class RCIteratorTraversal
- extends RCIterator
This class iterates/traverses through trees & graphs visiting each node once.
For trees it ensures a parent before child ordering (by using a LIFO queue traversal).
For graphs no such guarantee is given.
- Author:
- David Allen
RCIteratorTraversal
public RCIteratorTraversal(RCNode root)
RCIteratorTraversal
public RCIteratorTraversal(RCNode[] roots)
RCIteratorTraversal
public RCIteratorTraversal(Collection roots)
restart
public void restart()
- Specified by:
restart
in class RCIterator
hasNext
public boolean hasNext()
- Specified by:
hasNext
in interface Iterator
- Specified by:
hasNext
in class RCIterator
nextNode
public RCNode nextNode()
- Does not guarantee any particular ordering of the nodes returned.
- Specified by:
nextNode
in class RCIterator
Copyright 2010 UCLA Automated Reasoning Group