Package edu.isi.pegasus.planner.partitioner.graph

Class MapGraph.BottomUpIterator

  • All Implemented Interfaces:
    java.util.Iterator
    Enclosing class:
    MapGraph
    protected class MapGraph.BottomUpIterator
extends java.lang.Object
implements java.util.Iterator
    An inner iterator class that traverses through the Graph bottom up. The traversal of the graph is a modified BFS. A node is added to the queue only when all it's parents children been added to the queue.

    • Field Summary

      Fields 
      Modifier and Type Field Description
      private int mCurrentDepth
      The current height of the nodes that are being traversed in the BFS starting from the leaf.
      private java.util.List mLevelList
      A temporary list that stores all the nodes on a particular level.
      private java.util.LinkedList mQueue
      The first in first out queue, that manages the set of gray vertices in a breadth first search.

    • Constructor Summary

      Constructors 
      Constructor Description
      BottomUpIterator()
      The default constructor.

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      boolean hasNext()
      Always returns false, as an empty iterator.
      java.lang.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

      • Methods inherited from interface java.util.Iterator

        forEachRemaining

    • Field Detail

      • mQueue

        private java.util.LinkedList mQueue
        The first in first out queue, that manages the set of gray vertices in a breadth first search.

      • mCurrentDepth

        private int mCurrentDepth
        The current height of the nodes that are being traversed in the BFS starting from the leaf.

      • mLevelList

        private java.util.List mLevelList
        A temporary list that stores all the nodes on a particular level.

    • Constructor Detail

      • BottomUpIterator

        public BottomUpIterator()
        The default constructor.

    • Method Detail

      • hasNext

        public boolean hasNext()
        Always returns false, as an empty iterator.
        Specified by:
        hasNext in interface java.util.Iterator
        Returns:
        true if there are still nodes in the queue.

      • next

        public java.lang.Object next()
        Returns the next object in the traversal order.
        Specified by:
        next in interface java.util.Iterator
        Returns:
        null

      • remove

        public void remove()
        Method is not supported.
        Specified by:
        remove in interface java.util.Iterator