[Lemon-commits] Alpar Juttner: Fix wrong iteration in ListGraph ...

[Lemon HG]

details:   http://lemon.cs.elte.hu/hg/lemon/rev/81f70097df81
changeset: 1355:81f70097df81
user:      Alpar Juttner <alpar [at] cs.elte.hu>
date:      Fri May 22 17:38:17 2015 +0200
description:
	Fix wrong iteration in ListGraph snapshot (#598)

diffstat:

 lemon/list_graph.h |  8 ++++----
 1 files changed, 4 insertions(+), 4 deletions(-)

diffs (39 lines):

diff --git a/lemon/list_graph.h b/lemon/list_graph.h
--- a/lemon/list_graph.h
+++ b/lemon/list_graph.h
@@ -582,7 +582,7 @@
           snapshot.addNode(node);
         }
         virtual void add(const std::vector<Node>& nodes) {
-          for (int i = nodes.size() - 1; i >= 0; ++i) {
+          for (int i = nodes.size() - 1; i >= 0; --i) {
             snapshot.addNode(nodes[i]);
           }
         }
@@ -632,7 +632,7 @@
           snapshot.addArc(arc);
         }
         virtual void add(const std::vector<Arc>& arcs) {
-          for (int i = arcs.size() - 1; i >= 0; ++i) {
+          for (int i = arcs.size() - 1; i >= 0; --i) {
             snapshot.addArc(arcs[i]);
           }
         }
@@ -1394,7 +1394,7 @@
           snapshot.addNode(node);
         }
         virtual void add(const std::vector<Node>& nodes) {
-          for (int i = nodes.size() - 1; i >= 0; ++i) {
+          for (int i = nodes.size() - 1; i >= 0; --i) {
             snapshot.addNode(nodes[i]);
           }
         }
@@ -1444,7 +1444,7 @@
           snapshot.addEdge(edge);
         }
         virtual void add(const std::vector<Edge>& edges) {
-          for (int i = edges.size() - 1; i >= 0; ++i) {
+          for (int i = edges.size() - 1; i >= 0; --i) {
             snapshot.addEdge(edges[i]);
           }
         }