COIN-OR::LEMON - Graph Library

Changeset 209:765619b7cbb2 in lemon-1.2 for test/graph_maps_test.h


Ignore:
Timestamp:
07/13/08 20:51:02 (11 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Phase:
public
Message:

Apply unify-sources.sh to the source tree

File:
1 edited

Legend:

Unmodified
Added
Removed
  • test/graph_maps_test.h

    r171 r209  
    1 /* -*- C++ -*-
     1/* -*- mode: C++; indent-tabs-mode: nil; -*-
    22 *
    3  * This file is a part of LEMON, a generic C++ optimization library
     3 * This file is a part of LEMON, a generic C++ optimization library.
    44 *
    55 * Copyright (C) 2003-2008
     
    7272    for (int i = 0; i < num; ++i) {
    7373      for (int j = 0; j < i; ++j) {
    74         arcs.push_back(graph.addArc(nodes[i], nodes[j]));
     74        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    7575      }
    7676    }
     
    8585    for (int i = 0; i < num; ++i) {
    8686      for (int j = i + 1; j < num; ++j) {
    87         arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    88         map[arcs.back()] = 23;
     87        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
     88        map[arcs.back()] = 23;
    8989        check(map[arcs.back()] == 23, "Wrong operator[].");
    9090      }
     
    114114    for (int i = 0; i < num; ++i) {
    115115      for (int j = 0; j < i; ++j) {
    116         edges.push_back(graph.addEdge(nodes[i], nodes[j]));
     116        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    117117      }
    118118    }
     
    127127    for (int i = 0; i < num; ++i) {
    128128      for (int j = i + 1; j < num; ++j) {
    129         edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    130         map[edges.back()] = 23;
     129        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
     130        map[edges.back()] = 23;
    131131        check(map[edges.back()] == 23, "Wrong operator[].");
    132132      }
Note: See TracChangeset for help on using the changeset viewer.