diff -r 2d6c8075d9d0 -r 818510fa3d99 src/work/marci/leda/leda_graph_wrapper.h
--- a/src/work/marci/leda/leda_graph_wrapper.h	Wed Sep 29 14:12:26 2004 +0000
+++ b/src/work/marci/leda/leda_graph_wrapper.h	Wed Sep 29 15:30:04 2004 +0000
@@ -1,6 +1,6 @@
 // -*- c++ -*-
-#ifndef HUGO_LEDA_GRAPH_WRAPPER_H
-#define HUGO_LEDA_GRAPH_WRAPPER_H
+#ifndef LEMON_LEDA_GRAPH_WRAPPER_H
+#define LEMON_LEDA_GRAPH_WRAPPER_H
 
 #include <LEDA/graph.h>
 #include <LEDA/node_array.h>
@@ -14,15 +14,15 @@
 //using namespace leda;
 //#endif
 
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
 
-namespace hugo {
+namespace lemon {
 
-  /// \brief A graph wrapper structure for wrapping LEDA graphs in HUGO.
+  /// \brief A graph wrapper structure for wrapping LEDA graphs in LEMON.
   ///
   /// This graph wrapper class wraps LEDA graphs and LEDA parametrized graphs
-  /// to satisfy HUGO graph concepts.
-  /// Then the generic HUGOlib algorithms and wrappers can be used 
+  /// to satisfy LEMON graph concepts.
+  /// Then the generic LEMON algorithms and wrappers can be used 
   /// with LEDA graphs. 
   /// \ingroup gwrapper
   template<typename Graph>
@@ -298,7 +298,7 @@
 
 
     /// This class is to wrap existing 
-    /// LEDA node-maps to HUGO ones.
+    /// LEDA node-maps to LEMON ones.
     template<typename T> class NodeMapWrapper
     {
       leda_node_array<T>* leda_stuff;
@@ -320,7 +320,7 @@
     };
 
     /// This class is to wrap existing 
-    /// LEDA edge-maps to HUGO ones.
+    /// LEDA edge-maps to LEMON ones.
     template<typename T> class EdgeMapWrapper
     {
       leda_edge_array<T>* leda_stuff;
@@ -379,6 +379,6 @@
     }
   };
 
-} //namespace hugo
+} //namespace lemon
 
-#endif // HUGO_LEDA_GRAPH_WRAPPER_H
+#endif // LEMON_LEDA_GRAPH_WRAPPER_H