diff -r 2d6c8075d9d0 -r 818510fa3d99 src/test/dijkstra_heap_test.cc
--- a/src/test/dijkstra_heap_test.cc	Wed Sep 29 14:12:26 2004 +0000
+++ b/src/test/dijkstra_heap_test.cc	Wed Sep 29 15:30:04 2004 +0000
@@ -1,5 +1,5 @@
 /* -*- 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
  * (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -19,7 +19,7 @@
 //Fibonacci heap of fib_heap.h.
 
 //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:
 
 //- if the edges e=uv of the shortest path tree reported by dijkstra.h have
@@ -30,14 +30,14 @@
 #include <iostream>
 #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 **) {