lemon/dfs.h
changeset 2474 e6368948d5f7
parent 2439 3f1c7a6c33cd
child 2476 059dcdda37c5
equal deleted inserted replaced
38:0af17c88e670 39:c272e82026b1
   562     ///
   562     ///
   563     ///\pre init() must be called and at least one node should be added
   563     ///\pre init() must be called and at least one node should be added
   564     ///with addSource() before using this function.
   564     ///with addSource() before using this function.
   565     ///
   565     ///
   566     ///\param em must be a bool (or convertible) edge map. The algorithm
   566     ///\param em must be a bool (or convertible) edge map. The algorithm
   567     ///will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
   567     ///will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
   568     ///
   568     ///
   569     ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
   569     ///\return The reached edge \c e with <tt>em[e]<\tt> true or
   570     ///\c INVALID if no such edge was found.
   570     ///\c INVALID if no such edge was found.
   571     ///
   571     ///
   572     ///\warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,
   572     ///\warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,
   573     ///not a node map.
   573     ///not a node map.
   574     template<class EM>
   574     template<class EM>
  1456     ///
  1456     ///
  1457     /// \pre init() must be called and at least one node should be added
  1457     /// \pre init() must be called and at least one node should be added
  1458     /// with addSource() before using this function.
  1458     /// with addSource() before using this function.
  1459     ///
  1459     ///
  1460     /// \param em must be a bool (or convertible) edge map. The algorithm
  1460     /// \param em must be a bool (or convertible) edge map. The algorithm
  1461     /// will stop when it reaches an edge \c e with <tt>em[e]==true<\tt>.
  1461     /// will stop when it reaches an edge \c e with <tt>em[e]<\tt> true.
  1462     ///
  1462     ///
  1463     ///\return The reached edge \c e with <tt>em[e]==true<\tt> or
  1463     ///\return The reached edge \c e with <tt>em[e]<\tt> true or
  1464     ///\c INVALID if no such edge was found.
  1464     ///\c INVALID if no such edge was found.
  1465     ///
  1465     ///
  1466     /// \warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,
  1466     /// \warning Contrary to \ref Bfs and \ref Dijkstra, \c em is an edge map,
  1467     /// not a node map.
  1467     /// not a node map.
  1468     template <typename EM>
  1468     template <typename EM>