1.1 --- a/test/graph_test.h Sun Jul 13 16:46:56 2008 +0100
1.2 +++ b/test/graph_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 @@ -217,7 +217,7 @@
1.13 n.outcir.push_back(G.addEdge(n.outer[i],n.outer[(i+1)%num]));
1.14 n.incir.push_back(G.addEdge(n.inner[i],n.inner[(i+2)%num]));
1.15 }
1.16 -
1.17 +
1.18 return n;
1.19 }
1.20
1.21 @@ -246,7 +246,7 @@
1.22 bidirDigraph(G);
1.23 checkBidirPetersen(G, num);
1.24 }
1.25 -
1.26 +
1.27 template <class Graph>
1.28 void checkGraph() {
1.29 const int num = 5;