Changeset 1205:d3dcc49e6403 in lemon for lemon/nearest_neighbor_tsp.h

Timestamp:

02/28/13 17:13:14 (11 years ago)

Author:

Peter Kovacs <kpeter@…>

Branch:

default

Phase:

public

Message:

Use output iterator instead of a container (#386)
in tourNodes() functions of TSP algorithms

File:

• lemon/nearest_neighbor_tsp.h (modified) (1 diff)

lemon/nearest_neighbor_tsp.h

@@ -194 +194 @@
       ///
       /// This function copies the node sequence of the found tour into
-      /// the given standard container.
-      ///
-      /// \pre run() must be called before using this function.
-      template <typename Container>
-      void tourNodes(Container &container) const {
-        container.assign(_path.begin(), _path.end());
+      /// an STL container through the given output iterator. The
+      /// <tt>value_type</tt> of the container must be <tt>FullGraph::Node</tt>.
+      /// For example,
+      /// \code
+      /// std::vector<FullGraph::Node> nodes(countNodes(graph));
+      /// tsp.tourNodes(nodes.begin());
+      /// \endcode
+      /// or
+      /// \code
+      /// std::list<FullGraph::Node> nodes;
+      /// tsp.tourNodes(std::back_inserter(nodes));
+      /// \endcode
+      ///
+      /// \pre run() must be called before using this function.
+      template <typename Iterator>
+      void tourNodes(Iterator out) const {
+        std::copy(_path.begin(), _path.end(), out);
       }