1.1 --- a/src/work/marci/bfs_dfs.h	Wed Sep 29 14:12:26 2004 +0000
     1.2 +++ b/src/work/marci/bfs_dfs.h	Wed Sep 29 15:30:04 2004 +0000
     1.3 @@ -1,6 +1,6 @@
     1.4  // -*- c++ -*-
     1.5 -#ifndef HUGO_BFS_DFS_H
     1.6 -#define HUGO_BFS_DFS_H
     1.7 +#ifndef LEMON_BFS_DFS_H
     1.8 +#define LEMON_BFS_DFS_H
     1.9  
    1.10  /// \ingroup galgs
    1.11  /// \file
    1.12 @@ -14,9 +14,9 @@
    1.13  #include <stack>
    1.14  #include <utility>
    1.15  
    1.16 -#include <hugo/invalid.h>
    1.17 +#include <lemon/invalid.h>
    1.18  
    1.19 -namespace hugo {
    1.20 +namespace lemon {
    1.21  
    1.22    /// Bfs searches for the nodes wich are not marked in 
    1.23    /// \c reached_map
    1.24 @@ -117,7 +117,7 @@
    1.25      bool finished() const { return bfs_queue.empty(); }
    1.26      /// The conversion operator makes for converting the bfs-iterator 
    1.27      /// to an \c out-edge-iterator.
    1.28 -    ///\bug Edge have to be in HUGO 0.2
    1.29 +    ///\bug Edge have to be in LEMON 0.2
    1.30      operator Edge() const { return actual_edge; }
    1.31      /// Returns if b-node has been reached just now.
    1.32      bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    1.33 @@ -269,7 +269,7 @@
    1.34      bool finished() const { return dfs_stack.empty(); }
    1.35      /// The conversion operator makes for converting the bfs-iterator 
    1.36      /// to an \c out-edge-iterator.
    1.37 -    ///\bug Edge have to be in HUGO 0.2
    1.38 +    ///\bug Edge have to be in LEMON 0.2
    1.39      operator Edge() const { return actual_edge; }
    1.40      /// Returns if b-node has been reached just now.
    1.41      bool isBNodeNewlyReached() const { return b_node_newly_reached; }
    1.42 @@ -343,6 +343,6 @@
    1.43    };
    1.44  
    1.45  
    1.46 -} // namespace hugo
    1.47 +} // namespace lemon
    1.48  
    1.49 -#endif //HUGO_BFS_DFS_H
    1.50 +#endif //LEMON_BFS_DFS_H