Index: src/test/bfs_test.cc
===================================================================
--- src/test/bfs_test.cc	(revision 906)
+++ src/test/bfs_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/bfs_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/bfs_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,9 +16,9 @@
 
 #include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/bfs.h>
-#include<hugo/skeletons/graph.h>
+#include <lemon/smart_graph.h>
+#include <lemon/bfs.h>
+#include<lemon/skeletons/graph.h>
 
-using namespace hugo;
+using namespace lemon;
 
 const int PET_SIZE =5;
Index: src/test/dfs_test.cc
===================================================================
--- src/test/dfs_test.cc	(revision 906)
+++ src/test/dfs_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/dfs_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dfs_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,9 +16,9 @@
 
 #include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dfs.h>
-#include<hugo/skeletons/graph.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dfs.h>
+#include<lemon/skeletons/graph.h>
 
-using namespace hugo;
+using namespace lemon;
 
 const int PET_SIZE =5;
Index: src/test/dijkstra_heap_test.cc
===================================================================
--- src/test/dijkstra_heap_test.cc	(revision 906)
+++ src/test/dijkstra_heap_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/dijkstra_heap_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dijkstra_heap_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -20,5 +20,5 @@
 
 //The input is a graph in standard dimacs format from the standard input (like
-//in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
+//in /lemon_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
 //heaps, checking two postconditions:
 
@@ -31,12 +31,12 @@
 #include <math.h>
 
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/dijkstra.h>
-#include <hugo/time_measure.h>
-#include <hugo/bin_heap.h>
-#include <hugo/fib_heap.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/dijkstra.h>
+#include <lemon/time_measure.h>
+#include <lemon/bin_heap.h>
+#include <lemon/fib_heap.h>
 
-using namespace hugo;
+using namespace lemon;
 
 int main(int, char **) {
Index: src/test/dijkstra_test.cc
===================================================================
--- src/test/dijkstra_test.cc	(revision 906)
+++ src/test/dijkstra_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/dijkstra_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dijkstra_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,9 +16,9 @@
 
 #include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dijkstra.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/skeletons/maps.h>
-using namespace hugo;
+#include <lemon/smart_graph.h>
+#include <lemon/dijkstra.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/skeletons/maps.h>
+using namespace lemon;
 
 const int PET_SIZE =5;
Index: src/test/error_test.cc
===================================================================
--- src/test/error_test.cc	(revision 906)
+++ src/test/error_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/error_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/error_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -17,7 +17,7 @@
 #include <iostream>
 
-#include <hugo/error.h>
+#include <lemon/error.h>
 #include "test_tools.h"
-using namespace hugo;
+using namespace lemon;
 using std::cout;
 using std::endl;
Index: src/test/graph_test.cc
===================================================================
--- src/test/graph_test.cc	(revision 919)
+++ src/test/graph_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/graph_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,8 +16,8 @@
 
 #include<iostream>
-#include<hugo/smart_graph.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/list_graph.h>
-#include<hugo/full_graph.h>
+#include<lemon/smart_graph.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/list_graph.h>
+#include<lemon/full_graph.h>
 
 #include"test_tools.h"
@@ -34,5 +34,5 @@
 */
 
-using namespace hugo;
+using namespace lemon;
 
 template<class Graph> void bidirPetersen(Graph &G)
@@ -69,49 +69,49 @@
 
 //Compile Graph
-template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>
+template void lemon::checkCompileStaticGraph<skeleton::StaticGraph>
 (skeleton::StaticGraph &);
 
-template void hugo::checkCompileGraph<skeleton::ExtendableGraph>
+template void lemon::checkCompileGraph<skeleton::ExtendableGraph>
 (skeleton::ExtendableGraph &);
 
-template void hugo::checkCompileErasableGraph<skeleton::ErasableGraph>
+template void lemon::checkCompileErasableGraph<skeleton::ErasableGraph>
 (skeleton::ErasableGraph &);
 
 //Compile SmartGraph
-template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);
-template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
+template void lemon::checkCompileGraph<SmartGraph>(SmartGraph &);
+template void lemon::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
 
 //Compile SymSmartGraph
-template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
-template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
+template void lemon::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
+template void lemon::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
 
 //Compile ListGraph
-template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
-template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);
-template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
+template void lemon::checkCompileGraph<ListGraph>(ListGraph &);
+template void lemon::checkCompileErasableGraph<ListGraph>(ListGraph &);
+template void lemon::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
 
 
 //Compile SymListGraph
-template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
-template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
-template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileGraph<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
 
 //Compile FullGraph
-template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
-template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
+template void lemon::checkCompileStaticGraph<FullGraph>(FullGraph &);
+template void lemon::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
 
 //Compile EdgeSet <ListGraph>
-template void hugo::checkCompileGraph<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraph<EdgeSet <ListGraph> >
 (EdgeSet <ListGraph> &);
-template void hugo::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
 (EdgeSet <ListGraph> &);
-template void hugo::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
 (EdgeSet <ListGraph> &);
 
 //Compile EdgeSet <NodeSet>
-template void hugo::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
-template void hugo::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
+template void lemon::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
+template void lemon::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
 (EdgeSet <NodeSet> &);
-template void hugo::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
+template void lemon::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
 (EdgeSet <NodeSet> &);
 
Index: src/test/graph_test.h
===================================================================
--- src/test/graph_test.h	(revision 919)
+++ src/test/graph_test.h	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/graph_test.h - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_test.h - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -14,6 +14,6 @@
  *
  */
-#ifndef HUGO_TEST_GRAPH_TEST_H
-#define HUGO_TEST_GRAPH_TEST_H
+#ifndef LEMON_TEST_GRAPH_TEST_H
+#define LEMON_TEST_GRAPH_TEST_H
 
 
@@ -23,5 +23,5 @@
 //! \file
 //! \brief Some utility to  test graph classes.
-namespace hugo {
+namespace lemon {
 
   struct DummyType {
@@ -320,5 +320,5 @@
 
   
-} //namespace hugo
+} //namespace lemon
 
 
Index: src/test/graph_wrapper_test.cc
===================================================================
--- src/test/graph_wrapper_test.cc	(revision 906)
+++ src/test/graph_wrapper_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/graph_wrapper_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,9 +16,9 @@
 
 #include<iostream>
-#include<hugo/smart_graph.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/list_graph.h>
-#include<hugo/full_graph.h>
-#include<hugo/graph_wrapper.h>
+#include<lemon/smart_graph.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/list_graph.h>
+#include<lemon/full_graph.h>
+#include<lemon/graph_wrapper.h>
 
 #include"test/test_tools.h"
@@ -32,5 +32,5 @@
 */
 
-using namespace hugo;
+using namespace lemon;
 
 
Index: src/test/kruskal_test.cc
===================================================================
--- src/test/kruskal_test.cc	(revision 906)
+++ src/test/kruskal_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/kruskal_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/kruskal_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -19,13 +19,13 @@
 
 #include "test_tools.h"
-#include <hugo/maps.h>
-#include <hugo/kruskal.h>
-#include <hugo/list_graph.h>
-#include <hugo/skeletons/maps.h>
-#include <hugo/skeletons/graph.h>
+#include <lemon/maps.h>
+#include <lemon/kruskal.h>
+#include <lemon/list_graph.h>
+#include <lemon/skeletons/maps.h>
+#include <lemon/skeletons/graph.h>
 
 
 using namespace std;
-using namespace hugo;
+using namespace lemon;
 
 void checkCompileKruskal()
Index: src/test/min_cost_flow_test.cc
===================================================================
--- src/test/min_cost_flow_test.cc	(revision 906)
+++ src/test/min_cost_flow_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/min_cost_flow_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/min_cost_flow_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -17,11 +17,11 @@
 #include <iostream>
 #include "test_tools.h"
-#include <hugo/list_graph.h>
-#include <hugo/min_cost_flow.h>
+#include <lemon/list_graph.h>
+#include <lemon/min_cost_flow.h>
 //#include <path.h>
 //#include <maps.h>
 
 using namespace std;
-using namespace hugo;
+using namespace lemon;
 
 
Index: src/test/path_test.cc
===================================================================
--- src/test/path_test.cc	(revision 906)
+++ src/test/path_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/path_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/path_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -17,10 +17,10 @@
 #include <string>
 #include <iostream>
-#include <hugo/skeletons/path.h>
-#include <hugo/path.h>
-#include <hugo/list_graph.h>
+#include <lemon/skeletons/path.h>
+#include <lemon/path.h>
+#include <lemon/list_graph.h>
 
 using namespace std;
-using namespace hugo;
+using namespace lemon;
 using namespace skeleton;
 
Index: src/test/preflow_test.cc
===================================================================
--- src/test/preflow_test.cc	(revision 906)
+++ src/test/preflow_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/preflow_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/preflow_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -19,11 +19,11 @@
 
 #include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/preflow.h>
-#include <hugo/skeletons/graph.h>
-#include <hugo/skeletons/maps.h>
-
-using namespace hugo;
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/preflow.h>
+#include <lemon/skeletons/graph.h>
+#include <lemon/skeletons/maps.h>
+
+using namespace lemon;
 
 void check_Preflow() 
Index: src/test/suurballe_test.cc
===================================================================
--- src/test/suurballe_test.cc	(revision 906)
+++ src/test/suurballe_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/suurballe_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/suurballe_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -16,11 +16,11 @@
 
 #include <iostream>
-#include <hugo/list_graph.h>
-#include <hugo/suurballe.h>
+#include <lemon/list_graph.h>
+#include <lemon/suurballe.h>
 //#include <path.h>
 #include "test_tools.h"
 
 using namespace std;
-using namespace hugo;
+using namespace lemon;
 
 
Index: src/test/test_tools.h
===================================================================
--- src/test/test_tools.h	(revision 919)
+++ src/test/test_tools.h	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/test_tools.h - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools.h - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -15,6 +15,6 @@
  */
 
-#ifndef HUGO_TEST_TEST_TOOLS_H
-#define HUGO_TEST_TEST_TOOLS_H
+#ifndef LEMON_TEST_TEST_TOOLS_H
+#define LEMON_TEST_TEST_TOOLS_H
 
 //! \ingroup misc
Index: src/test/test_tools_fail.cc
===================================================================
--- src/test/test_tools_fail.cc	(revision 906)
+++ src/test/test_tools_fail.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/test_tools_fail.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools_fail.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
Index: src/test/test_tools_pass.cc
===================================================================
--- src/test/test_tools_pass.cc	(revision 906)
+++ src/test/test_tools_pass.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/test_tools_pass.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools_pass.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
Index: src/test/time_measure_test.cc
===================================================================
--- src/test/time_measure_test.cc	(revision 906)
+++ src/test/time_measure_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/time_measure_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/time_measure_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -15,5 +15,5 @@
  */
 
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
 
 ///\file \brief Test cases for time_measure.h
@@ -22,5 +22,5 @@
 
 
-using namespace hugo;
+using namespace lemon;
 
 int main()
Index: src/test/unionfind_test.cc
===================================================================
--- src/test/unionfind_test.cc	(revision 906)
+++ src/test/unionfind_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/unionfind_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/unionfind_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -17,9 +17,9 @@
 #include <iostream>
 
-#include <hugo/maps.h>
-#include <hugo/unionfind.h>
+#include <lemon/maps.h>
+#include <lemon/unionfind.h>
 #include "test_tools.h"
 
-using namespace hugo;
+using namespace lemon;
 using namespace std;
 
Index: src/test/xy_test.cc
===================================================================
--- src/test/xy_test.cc	(revision 906)
+++ src/test/xy_test.cc	(revision 921)
@@ -1,4 +1,4 @@
 /* -*- C++ -*-
- * src/test/xy_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/xy_test.cc - Part of LEMON, a generic C++ optimization library
  *
  * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
@@ -15,10 +15,10 @@
  */
 
-#include <hugo/xy.h>
+#include <lemon/xy.h>
 #include <iostream>
 #include "test_tools.h"
 
 using namespace std;
-using namespace hugo;
+using namespace lemon;
 int main()
 {