1.1 --- a/src/work/marci/bfs_dfs.h Mon May 17 15:11:05 2004 +0000
1.2 +++ b/src/work/marci/bfs_dfs.h Wed May 19 16:06:57 2004 +0000
1.3 @@ -106,19 +106,19 @@
1.4 }
1.5 return *this;
1.6 }
1.7 - /// Guess what?
1.8 + /// Returns true iff the algorithm is finished.
1.9 bool finished() const { return bfs_queue.empty(); }
1.10 /// The conversion operator makes for converting the bfs-iterator
1.11 /// to an \c out-edge-iterator.
1.12 ///\bug Edge have to be in HUGO 0.2
1.13 operator OutEdgeIt() const { return actual_edge; }
1.14 - /// Guess what?
1.15 + /// Returns if b-node has been reached just now.
1.16 bool isBNodeNewlyReached() const { return b_node_newly_reached; }
1.17 - /// Guess what?
1.18 + /// Returns if a-node is examined.
1.19 bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
1.20 - /// Guess what?
1.21 + /// Returns a-node of the actual edge, so does if the edge is invalid.
1.22 Node aNode() const { return bfs_queue.front(); }
1.23 - /// Guess what?
1.24 + /// \pre The actual edge have to be valid.
1.25 Node bNode() const { return graph->bNode(actual_edge); }
1.26 /// Guess what?
1.27 const ReachedMap& getReachedMap() const { return reached; }
1.28 @@ -249,17 +249,20 @@
1.29 }
1.30 return *this;
1.31 }
1.32 - /// Guess what?
1.33 + /// Returns true iff the algorithm is finished.
1.34 bool finished() const { return dfs_stack.empty(); }
1.35 - /// Guess what?
1.36 + /// The conversion operator makes for converting the bfs-iterator
1.37 + /// to an \c out-edge-iterator.
1.38 + ///\bug Edge have to be in HUGO 0.2
1.39 operator OutEdgeIt() const { return actual_edge; }
1.40 - /// Guess what?
1.41 + /// Returns if b-node has been reached just now.
1.42 bool isBNodeNewlyReached() const { return b_node_newly_reached; }
1.43 - /// Guess what?
1.44 + /// Returns if a-node is examined.
1.45 bool isANodeExamined() const { return !(graph->valid(actual_edge)); }
1.46 - /// Guess what?
1.47 + /// Returns a-node of the actual edge, so does if the edge is invalid.
1.48 Node aNode() const { return actual_node; /*FIXME*/}
1.49 - /// Guess what?
1.50 + /// Returns b-node of the actual edge.
1.51 + /// \pre The actual edge have to be valid.
1.52 Node bNode() const { return graph->bNode(actual_edge); }
1.53 /// Guess what?
1.54 const ReachedMap& getReachedMap() const { return reached; }