Changeset 1665:fdeb961110ac in lemon-0.x for lemon/dfs.h

Timestamp:

08/30/05 16:55:11 (19 years ago)

Author:

Alpar Juttner

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2181

Message:

Functions to query the next node/edge to be processed.

File:

• lemon/dfs.h (modified) (3 diffs)

lemon/dfs.h

@@ -553 +553 @@
       return e;
     }
+    ///Next edge to be processed.
+
+    ///Next edge to be processed.
+    ///
+    ///\return The next edge to be processed or INVALID if the stack is
+    /// empty.
+    OutEdgeIt NextEdge()
+    { 
+      return _stack_head>=0?_stack[_stack_head]:INVALID;
+    }
       
     ///\brief Returns \c false if there are nodes
@@ -559 +569 @@
     ///Returns \c false if there are nodes
     ///to be processed in the queue
+    ///
+    ///\todo This should be called emptyStack() or some "neutral" name.
     bool emptyQueue() { return _stack_head<0; }
     ///Returns the number of the nodes to be processed.
@@ -564 +576 @@
     ///Returns the number of the nodes to be processed in the queue.
     ///
+    ///\todo This should be called stackSize() or some "neutral" name.
     int queueSize() { return _stack_head+1; }