Changeset 646:bd7a69231cf8 in lemon0.x for src/work/marci/bfs_dfs.h
 Timestamp:
 05/19/04 18:06:57 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@846
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/bfs_dfs.h
r615 r646 107 107 return *this; 108 108 } 109 /// Guess what?109 /// Returns true iff the algorithm is finished. 110 110 bool finished() const { return bfs_queue.empty(); } 111 111 /// The conversion operator makes for converting the bfsiterator … … 113 113 ///\bug Edge have to be in HUGO 0.2 114 114 operator OutEdgeIt() const { return actual_edge; } 115 /// Guess what?115 /// Returns if bnode has been reached just now. 116 116 bool isBNodeNewlyReached() const { return b_node_newly_reached; } 117 /// Guess what?117 /// Returns if anode is examined. 118 118 bool isANodeExamined() const { return !(graph>valid(actual_edge)); } 119 /// Guess what?119 /// Returns anode of the actual edge, so does if the edge is invalid. 120 120 Node aNode() const { return bfs_queue.front(); } 121 /// Guess what?121 /// \pre The actual edge have to be valid. 122 122 Node bNode() const { return graph>bNode(actual_edge); } 123 123 /// Guess what? … … 250 250 return *this; 251 251 } 252 /// Guess what?252 /// Returns true iff the algorithm is finished. 253 253 bool finished() const { return dfs_stack.empty(); } 254 /// Guess what? 254 /// The conversion operator makes for converting the bfsiterator 255 /// to an \c outedgeiterator. 256 ///\bug Edge have to be in HUGO 0.2 255 257 operator OutEdgeIt() const { return actual_edge; } 256 /// Guess what?258 /// Returns if bnode has been reached just now. 257 259 bool isBNodeNewlyReached() const { return b_node_newly_reached; } 258 /// Guess what?260 /// Returns if anode is examined. 259 261 bool isANodeExamined() const { return !(graph>valid(actual_edge)); } 260 /// Guess what?262 /// Returns anode of the actual edge, so does if the edge is invalid. 261 263 Node aNode() const { return actual_node; /*FIXME*/} 262 /// Guess what? 264 /// Returns bnode of the actual edge. 265 /// \pre The actual edge have to be valid. 263 266 Node bNode() const { return graph>bNode(actual_edge); } 264 267 /// Guess what?
Note: See TracChangeset
for help on using the changeset viewer.