1.1 --- a/test/graph_utils_test.cc Sun Jul 13 16:46:56 2008 +0100
1.2 +++ b/test/graph_utils_test.cc 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 @@ -140,7 +140,7 @@
1.13 void checkDeg()
1.14 {
1.15 TEMPLATE_DIGRAPH_TYPEDEFS(Digraph);
1.16 -
1.17 +
1.18 const int nodeNum = 10;
1.19 const int arcNum = 100;
1.20 Digraph digraph;
1.21 @@ -155,11 +155,11 @@
1.22 arcs[i] = digraph.addArc(nodes[rnd[nodeNum]], nodes[rnd[nodeNum]]);
1.23 }
1.24 for (int i = 0; i < nodeNum; ++i) {
1.25 - check(inDeg[nodes[i]] == countInArcs(digraph, nodes[i]),
1.26 + check(inDeg[nodes[i]] == countInArcs(digraph, nodes[i]),
1.27 "Wrong in degree map");
1.28 }
1.29 for (int i = 0; i < nodeNum; ++i) {
1.30 - check(outDeg[nodes[i]] == countOutArcs(digraph, nodes[i]),
1.31 + check(outDeg[nodes[i]] == countOutArcs(digraph, nodes[i]),
1.32 "Wrong out degree map");
1.33 }
1.34 }
1.35 @@ -172,15 +172,15 @@
1.36 Digraph g;
1.37 Node n1=g.addNode();
1.38 Node n2=g.addNode();
1.39 -
1.40 +
1.41 InDegMap<Digraph> ind(g);
1.42 -
1.43 +
1.44 g.addArc(n1,n2);
1.45 -
1.46 +
1.47 typename Digraph::Snapshot snap(g);
1.48 -
1.49 +
1.50 OutDegMap<Digraph> outd(g);
1.51 -
1.52 +
1.53 check(ind[n1]==0 && ind[n2]==1, "Wrong InDegMap value.");
1.54 check(outd[n1]==1 && outd[n2]==0, "Wrong OutDegMap value.");
1.55