Merge bugfix #598 to branch 1.3 1.3
authorAlpar Juttner <alpar@cs.elte.hu>
Fri, 22 May 2015 17:48:24 +0200
branch1.3
changeset 115348a0d237db3c
parent 1149 57a344e446c9
parent 1152 2126945deb6a
child 1155 a7d841273c68
Merge bugfix #598 to branch 1.3
     1.1 --- a/lemon/list_graph.h	Thu May 07 11:41:48 2015 +0200
     1.2 +++ b/lemon/list_graph.h	Fri May 22 17:48:24 2015 +0200
     1.3 @@ -582,7 +582,7 @@
     1.4            snapshot.addNode(node);
     1.5          }
     1.6          virtual void add(const std::vector<Node>& nodes) {
     1.7 -          for (int i = nodes.size() - 1; i >= 0; ++i) {
     1.8 +          for (int i = nodes.size() - 1; i >= 0; --i) {
     1.9              snapshot.addNode(nodes[i]);
    1.10            }
    1.11          }
    1.12 @@ -632,7 +632,7 @@
    1.13            snapshot.addArc(arc);
    1.14          }
    1.15          virtual void add(const std::vector<Arc>& arcs) {
    1.16 -          for (int i = arcs.size() - 1; i >= 0; ++i) {
    1.17 +          for (int i = arcs.size() - 1; i >= 0; --i) {
    1.18              snapshot.addArc(arcs[i]);
    1.19            }
    1.20          }
    1.21 @@ -1394,7 +1394,7 @@
    1.22            snapshot.addNode(node);
    1.23          }
    1.24          virtual void add(const std::vector<Node>& nodes) {
    1.25 -          for (int i = nodes.size() - 1; i >= 0; ++i) {
    1.26 +          for (int i = nodes.size() - 1; i >= 0; --i) {
    1.27              snapshot.addNode(nodes[i]);
    1.28            }
    1.29          }
    1.30 @@ -1444,7 +1444,7 @@
    1.31            snapshot.addEdge(edge);
    1.32          }
    1.33          virtual void add(const std::vector<Edge>& edges) {
    1.34 -          for (int i = edges.size() - 1; i >= 0; ++i) {
    1.35 +          for (int i = edges.size() - 1; i >= 0; --i) {
    1.36              snapshot.addEdge(edges[i]);
    1.37            }
    1.38          }
    1.39 @@ -2299,7 +2299,7 @@
    1.40            snapshot.addNode(node);
    1.41          }
    1.42          virtual void add(const std::vector<Node>& nodes) {
    1.43 -          for (int i = nodes.size() - 1; i >= 0; ++i) {
    1.44 +          for (int i = nodes.size() - 1; i >= 0; --i) {
    1.45              snapshot.addNode(nodes[i]);
    1.46            }
    1.47          }
    1.48 @@ -2349,7 +2349,7 @@
    1.49            snapshot.addEdge(edge);
    1.50          }
    1.51          virtual void add(const std::vector<Edge>& edges) {
    1.52 -          for (int i = edges.size() - 1; i >= 0; ++i) {
    1.53 +          for (int i = edges.size() - 1; i >= 0; --i) {
    1.54              snapshot.addEdge(edges[i]);
    1.55            }
    1.56          }