1.1 --- a/test/graph_maps_test.h	Sun Jul 13 16:46:56 2008 +0100
     1.2 +++ b/test/graph_maps_test.h	Sun Jul 13 19:51:02 2008 +0100
     1.3 @@ -1,6 +1,6 @@
     1.4 -/* -*- C++ -*-
     1.5 +/* -*- mode: C++; indent-tabs-mode: nil; -*-
     1.6   *
     1.7 - * This file is a part of LEMON, a generic C++ optimization library
     1.8 + * This file is a part of LEMON, a generic C++ optimization library.
     1.9   *
    1.10   * Copyright (C) 2003-2008
    1.11   * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    1.12 @@ -71,7 +71,7 @@
    1.13      std::vector<Arc> arcs;
    1.14      for (int i = 0; i < num; ++i) {
    1.15        for (int j = 0; j < i; ++j) {
    1.16 -	arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    1.17 +        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    1.18        }
    1.19      }
    1.20  
    1.21 @@ -84,8 +84,8 @@
    1.22  
    1.23      for (int i = 0; i < num; ++i) {
    1.24        for (int j = i + 1; j < num; ++j) {
    1.25 -	arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    1.26 -	map[arcs.back()] = 23;
    1.27 +        arcs.push_back(graph.addArc(nodes[i], nodes[j]));
    1.28 +        map[arcs.back()] = 23;
    1.29          check(map[arcs.back()] == 23, "Wrong operator[].");
    1.30        }
    1.31      }
    1.32 @@ -113,7 +113,7 @@
    1.33      std::vector<Edge> edges;
    1.34      for (int i = 0; i < num; ++i) {
    1.35        for (int j = 0; j < i; ++j) {
    1.36 -	edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    1.37 +        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    1.38        }
    1.39      }
    1.40  
    1.41 @@ -126,8 +126,8 @@
    1.42  
    1.43      for (int i = 0; i < num; ++i) {
    1.44        for (int j = i + 1; j < num; ++j) {
    1.45 -	edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    1.46 -	map[edges.back()] = 23;
    1.47 +        edges.push_back(graph.addEdge(nodes[i], nodes[j]));
    1.48 +        map[edges.back()] = 23;
    1.49          check(map[edges.back()] == 23, "Wrong operator[].");
    1.50        }
    1.51      }