Changeset 1865:dcefd1d1377f in lemon-0.x for lemon/dfs.h
- Timestamp:
- 12/19/05 10:47:10 (19 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2438
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/dfs.h
r1799 r1865 560 560 ///with addSource() before using this function. 561 561 /// 562 ///\param nm must be a bool (or convertible) edge map. The algorithm563 ///will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.562 ///\param em must be a bool (or convertible) edge map. The algorithm 563 ///will stop when it reaches an edge \c e with \code em[e]==true \endcode. 564 564 /// 565 565 ///\warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map, … … 1145 1145 /// 1146 1146 /// This function instantiates a \ref ReachedMap. 1147 /// \param Gis the graph, to which1147 /// \param graph is the graph, to which 1148 1148 /// we would like to define the \ref ReachedMap. 1149 1149 static ReachedMap *createReachedMap(const Graph &graph) { … … 1428 1428 /// with addSource() before using this function. 1429 1429 /// 1430 /// \param nm must be a bool (or convertible) edge map. The algorithm1431 /// will stop when it reaches an edge \c e with <tt>nm[e]==true</tt>.1430 /// \param em must be a bool (or convertible) edge map. The algorithm 1431 /// will stop when it reaches an edge \c e with \code nm[e]==true \endcode. 1432 1432 /// 1433 1433 /// \warning Contrary to \ref Dfs and \ref Dijkstra, \c em is an edge map,
Note: See TracChangeset
for help on using the changeset viewer.