1.1 --- a/src/test/graph_test.cc	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/test/graph_test.cc	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -1,5 +1,5 @@
     1.4  /* -*- C++ -*-
     1.5 - * src/test/graph_test.cc - Part of HUGOlib, a generic C++ optimization library
     1.6 + * src/test/graph_test.cc - Part of LEMON, a generic C++ optimization library
     1.7   *
     1.8   * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
     1.9   * (Egervary Combinatorial Optimization Research Group, EGRES).
    1.10 @@ -15,10 +15,10 @@
    1.11   */
    1.12  
    1.13  #include<iostream>
    1.14 -#include<hugo/smart_graph.h>
    1.15 -#include<hugo/skeletons/graph.h>
    1.16 -#include<hugo/list_graph.h>
    1.17 -#include<hugo/full_graph.h>
    1.18 +#include<lemon/smart_graph.h>
    1.19 +#include<lemon/skeletons/graph.h>
    1.20 +#include<lemon/list_graph.h>
    1.21 +#include<lemon/full_graph.h>
    1.22  
    1.23  #include"test_tools.h"
    1.24  #include"graph_test.h"
    1.25 @@ -33,7 +33,7 @@
    1.26  conversion.
    1.27  */
    1.28  
    1.29 -using namespace hugo;
    1.30 +using namespace lemon;
    1.31  
    1.32  template<class Graph> void bidirPetersen(Graph &G)
    1.33  {
    1.34 @@ -68,51 +68,51 @@
    1.35  }
    1.36  
    1.37  //Compile Graph
    1.38 -template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>
    1.39 +template void lemon::checkCompileStaticGraph<skeleton::StaticGraph>
    1.40  (skeleton::StaticGraph &);
    1.41  
    1.42 -template void hugo::checkCompileGraph<skeleton::ExtendableGraph>
    1.43 +template void lemon::checkCompileGraph<skeleton::ExtendableGraph>
    1.44  (skeleton::ExtendableGraph &);
    1.45  
    1.46 -template void hugo::checkCompileErasableGraph<skeleton::ErasableGraph>
    1.47 +template void lemon::checkCompileErasableGraph<skeleton::ErasableGraph>
    1.48  (skeleton::ErasableGraph &);
    1.49  
    1.50  //Compile SmartGraph
    1.51 -template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);
    1.52 -template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
    1.53 +template void lemon::checkCompileGraph<SmartGraph>(SmartGraph &);
    1.54 +template void lemon::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
    1.55  
    1.56  //Compile SymSmartGraph
    1.57 -template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
    1.58 -template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    1.59 +template void lemon::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
    1.60 +template void lemon::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
    1.61  
    1.62  //Compile ListGraph
    1.63 -template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
    1.64 -template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);
    1.65 -template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    1.66 +template void lemon::checkCompileGraph<ListGraph>(ListGraph &);
    1.67 +template void lemon::checkCompileErasableGraph<ListGraph>(ListGraph &);
    1.68 +template void lemon::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
    1.69  
    1.70  
    1.71  //Compile SymListGraph
    1.72 -template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
    1.73 -template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    1.74 -template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    1.75 +template void lemon::checkCompileGraph<SymListGraph>(SymListGraph &);
    1.76 +template void lemon::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
    1.77 +template void lemon::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
    1.78  
    1.79  //Compile FullGraph
    1.80 -template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
    1.81 -template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
    1.82 +template void lemon::checkCompileStaticGraph<FullGraph>(FullGraph &);
    1.83 +template void lemon::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
    1.84  
    1.85  //Compile EdgeSet <ListGraph>
    1.86 -template void hugo::checkCompileGraph<EdgeSet <ListGraph> >
    1.87 +template void lemon::checkCompileGraph<EdgeSet <ListGraph> >
    1.88  (EdgeSet <ListGraph> &);
    1.89 -template void hugo::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
    1.90 +template void lemon::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
    1.91  (EdgeSet <ListGraph> &);
    1.92 -template void hugo::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
    1.93 +template void lemon::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
    1.94  (EdgeSet <ListGraph> &);
    1.95  
    1.96  //Compile EdgeSet <NodeSet>
    1.97 -template void hugo::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
    1.98 -template void hugo::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
    1.99 +template void lemon::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
   1.100 +template void lemon::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
   1.101  (EdgeSet <NodeSet> &);
   1.102 -template void hugo::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
   1.103 +template void lemon::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
   1.104  (EdgeSet <NodeSet> &);
   1.105  
   1.106