|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||
java.lang.Objectedu.isi.pegasus.planner.partitioner.graph.MapGraph.MapGraphIterator
protected class MapGraph.MapGraphIterator
An inner iterator class that traverses through the Graph. The traversal of the graph is a modified BFS. A node is added to the queue only when all it's parents have been added to the queue.
| Field Summary | |
|---|---|
private int |
mCurrentDepth
The current depth of the nodes that are being traversed in the BFS. |
private List |
mLevelList
A temporary list that stores all the nodes on a particular level. |
private LinkedList |
mQueue
The first in first out queue, that manages the set of gray vertices in a breadth first search. |
| Constructor Summary | |
|---|---|
MapGraph.MapGraphIterator()
The default constructor. |
|
| Method Summary | |
|---|---|
boolean |
hasNext()
Always returns false, as an empty iterator. |
Object |
next()
Returns the next object in the traversal order. |
void |
remove()
Method is not supported. |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
| Field Detail |
|---|
private LinkedList mQueue
private int mCurrentDepth
private List mLevelList
| Constructor Detail |
|---|
public MapGraph.MapGraphIterator()
| Method Detail |
|---|
public boolean hasNext()
hasNext in interface Iteratorpublic Object next()
next in interface Iteratorpublic void remove()
remove in interface Iterator
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |||||||||