Changeset 646:bd7a69231cf8 in lemon-0.x for src/work/marci/bfs_dfs.h

Timestamp:

05/19/04 18:06:57 (20 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

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

Message:

max_flow.h: status flags for actMinCut
leda_graph_wrapper.h: NodeMapWrapper?, EdgeMapWrapper?

File:

• src/work/marci/bfs_dfs.h (modified) (3 diffs)

src/work/marci/bfs_dfs.h

@@ -107 +107 @@
       return *this;
     }
-    /// Guess what?
+    /// Returns true iff the algorithm is finished.
     bool finished() const { return bfs_queue.empty(); }
     /// The conversion operator makes for converting the bfs-iterator 
@@ -113 +113 @@
     ///\bug Edge have to be in HUGO 0.2
     operator OutEdgeIt() const { return actual_edge; }
-    /// Guess what?
+    /// Returns if b-node has been reached just now.
     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
-    /// Guess what?
+    /// Returns if a-node is examined.
     bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
-    /// Guess what?
+    /// Returns a-node of the actual edge, so does if the edge is invalid.
     Node aNode() const { return bfs_queue.front(); }
-    /// Guess what?
+    /// \pre The actual edge have to be valid.
     Node bNode() const { return graph->bNode(actual_edge); }
     /// Guess what?
@@ -250 +250 @@
       return *this;
     }
-    /// Guess what?
+    /// Returns true iff the algorithm is finished.
     bool finished() const { return dfs_stack.empty(); }
-    /// Guess what?
+    /// The conversion operator makes for converting the bfs-iterator 
+    /// to an \c out-edge-iterator.
+    ///\bug Edge have to be in HUGO 0.2
     operator OutEdgeIt() const { return actual_edge; }
-    /// Guess what?
+    /// Returns if b-node has been reached just now.
     bool isBNodeNewlyReached() const { return b_node_newly_reached; }
-    /// Guess what?
+    /// Returns if a-node is examined.
     bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
-    /// Guess what?
+    /// Returns a-node of the actual edge, so does if the edge is invalid.
     Node aNode() const { return actual_node; /*FIXME*/}
-    /// Guess what?
+    /// Returns b-node of the actual edge. 
+    /// \pre The actual edge have to be valid.
     Node bNode() const { return graph->bNode(actual_edge); }
     /// Guess what?