lemon/maps.h
changeset 751 f5f260a63a9b
parent 725 11404088d1a5
parent 717 684964884a2e
child 786 e20173729589
child 789 8ddb7deabab9
equal deleted inserted replaced
43:ba6ccd20fc59 44:50dbf6892c00
  1787   /// that were marked \c true by an algorithm.
  1787   /// that were marked \c true by an algorithm.
  1788   /// For example it makes easier to store the nodes in the processing
  1788   /// For example it makes easier to store the nodes in the processing
  1789   /// order of Dfs algorithm, as the following examples show.
  1789   /// order of Dfs algorithm, as the following examples show.
  1790   /// \code
  1790   /// \code
  1791   ///   std::vector<Node> v;
  1791   ///   std::vector<Node> v;
  1792   ///   dfs(g,s).processedMap(loggerBoolMap(std::back_inserter(v))).run();
  1792   ///   dfs(g).processedMap(loggerBoolMap(std::back_inserter(v))).run(s);
  1793   /// \endcode
  1793   /// \endcode
  1794   /// \code
  1794   /// \code
  1795   ///   std::vector<Node> v(countNodes(g));
  1795   ///   std::vector<Node> v(countNodes(g));
  1796   ///   dfs(g,s).processedMap(loggerBoolMap(v.begin())).run();
  1796   ///   dfs(g).processedMap(loggerBoolMap(v.begin())).run(s);
  1797   /// \endcode
  1797   /// \endcode
  1798   ///
  1798   ///
  1799   /// \note The container of the iterator must contain enough space
  1799   /// \note The container of the iterator must contain enough space
  1800   /// for the elements or the iterator should be an inserter iterator.
  1800   /// for the elements or the iterator should be an inserter iterator.
  1801   ///
  1801   ///