diff -r f22bc76370b2 -r f1398882a928 test/gomory_hu_test.cc
--- a/test/gomory_hu_test.cc	Fri Aug 05 09:33:42 2011 +0200
+++ b/test/gomory_hu_test.cc	Mon Aug 08 12:36:16 2011 +0200
@@ -1,3 +1,21 @@
+/* -*- mode: C++; indent-tabs-mode: nil; -*-
+ *
+ * This file is a part of LEMON, a generic C++ optimization library.
+ *
+ * Copyright (C) 2003-2011
+ * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
+ * (Egervary Research Group on Combinatorial Optimization, EGRES).
+ *
+ * Permission to use, modify and distribute this software is granted
+ * provided that this copyright notice appears in all copies. For
+ * precise terms see the accompanying LICENSE file.
+ *
+ * This software is provided "AS IS" with no warranty of any kind,
+ * express or implied, and with no claim as to its suitability for any
+ * purpose.
+ *
+ */
+
 #include <iostream>
 
 #include "test_tools.h"
@@ -33,7 +51,7 @@
   "@attributes\n"
   "source 0\n"
   "target 3\n";
-  
+
 void checkGomoryHuCompile()
 {
   typedef int Value;
@@ -69,7 +87,7 @@
 typedef Graph::NodeMap<bool> BoolNodeMap;
 
 int cutValue(const Graph& graph, const BoolNodeMap& cut,
-	     const IntEdgeMap& capacity) {
+             const IntEdgeMap& capacity) {
 
   int sum = 0;
   for (EdgeIt e(graph); e != INVALID; ++e) {
@@ -107,7 +125,7 @@
 
       int sum=0;
       for(GomoryHu<Graph>::MinCutEdgeIt a(ght, u, v);a!=INVALID;++a)
-        sum+=capacity[a]; 
+        sum+=capacity[a];
       check(sum == ght.minCutValue(u, v), "Problem with MinCutEdgeIt");
 
       sum=0;
@@ -118,6 +136,6 @@
       check(sum == countNodes(graph), "Problem with MinCutNodeIt");
     }
   }
-  
+
   return 0;
 }