Changeset 650:588ff2ca55bd in lemon0.x for src/work/marci/bfs_dfs.h
 Timestamp:
 05/20/04 17:40:59 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@850
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

src/work/marci/bfs_dfs.h
r646 r650 21 21 /// Bfs searches for the nodes wich are not marked in 22 22 /// \c reached_map 23 /// Reached have to work as readwrite bool Nodemap.23 /// Reached have to be a readwrite bool nodemap. 24 24 /// \ingroup galgs 25 25 template <typename Graph, /*typename OutEdgeIt,*/ … … 37 37 public: 38 38 /// In that constructor \c _reached have to be a reference 39 /// for a bool Nodemap. The algorithm will search in a bfs order for 40 /// the nodes which are \c false initially 39 /// for a bool bodemap. The algorithm will search for the 40 /// initially \c false nodes 41 /// in a bfs order. 41 42 BfsIterator(const Graph& _graph, ReachedMap& _reached) : 42 43 graph(&_graph), reached(_reached), … … 44 45 /// The same as above, but the map storing the reached nodes 45 46 /// is constructed dynamically to everywhere false. 47 /// \deprecated 46 48 BfsIterator(const Graph& _graph) : 47 49 graph(&_graph), reached(*(new ReachedMap(*graph /*, false*/))), … … 122 124 Node bNode() const { return graph>bNode(actual_edge); } 123 125 /// Guess what? 126 /// \deprecated 124 127 const ReachedMap& getReachedMap() const { return reached; } 125 128 /// Guess what? 129 /// \deprecated 126 130 const std::queue<Node>& getBfsQueue() const { return bfs_queue; } 127 131 }; … … 130 134 /// \c reached_map 131 135 /// Reached have to work as a readwrite bool Nodemap, 132 /// Pred is a write Edge Nodemap and133 /// Dist is a readwrite Nodemap of integral value, have to be.136 /// Pred is a write edge nodemap and 137 /// Dist is a readwrite nodemap of integral value, have to be. 134 138 /// \ingroup galgs 135 139 template <typename Graph, … … 180 184 } 181 185 /// Guess what? 186 /// \deprecated 182 187 const PredMap& getPredMap() const { return pred; } 183 188 /// Guess what? 189 /// \deprecated 184 190 const DistMap& getDistMap() const { return dist; } 185 191 }; … … 204 210 public: 205 211 /// In that constructor \c _reached have to be a reference 206 /// for a bool Nodemap. The algorithm will search in a dfs order for212 /// for a bool nodemap. The algorithm will search in a dfs order for 207 213 /// the nodes which are \c false initially 208 214 DfsIterator(const Graph& _graph, ReachedMap& _reached) : … … 266 272 Node bNode() const { return graph>bNode(actual_edge); } 267 273 /// Guess what? 274 /// \deprecated 268 275 const ReachedMap& getReachedMap() const { return reached; } 269 276 /// Guess what? 277 /// \deprecated 270 278 const std::stack<OutEdgeIt>& getDfsStack() const { return dfs_stack; } 271 279 }; … … 273 281 /// Dfs searches for the nodes wich are not marked in 274 282 /// \c reached_map 275 /// Reached is a readwrite bool Nodemap,276 /// Pred is a write Nodemap, have to be.283 /// Reached is a readwrite bool nodemap, 284 /// Pred is a write nodemap, have to be. 277 285 /// \ingroup galgs 278 286 template <typename Graph, … … 319 327 } 320 328 /// Guess what? 329 /// \deprecated 321 330 const PredMap& getPredMap() const { return pred; } 322 331 };
Note: See TracChangeset
for help on using the changeset viewer.