1.1 --- a/test/dfs_test.cc	Tue Oct 24 16:49:41 2006 +0000
     1.2 +++ b/test/dfs_test.cc	Tue Oct 24 17:19:16 2006 +0000
     1.3 @@ -20,7 +20,7 @@
     1.4  #include <lemon/smart_graph.h>
     1.5  #include <lemon/dfs.h>
     1.6  #include <lemon/path.h>
     1.7 -#include <lemon/concept/graph.h>
     1.8 +#include <lemon/concepts/graph.h>
     1.9  
    1.10  using namespace lemon;
    1.11  
    1.12 @@ -29,7 +29,7 @@
    1.13  
    1.14  void check_Dfs_SmartGraph_Compile() 
    1.15  {
    1.16 -  typedef concept::Graph Graph;
    1.17 +  typedef concepts::Graph Graph;
    1.18  
    1.19    typedef Graph::Edge Edge;
    1.20    typedef Graph::Node Node;
    1.21 @@ -67,22 +67,22 @@
    1.22  void check_Dfs_Function_Compile() 
    1.23  {
    1.24    typedef int VType;
    1.25 -  typedef concept::Graph Graph;
    1.26 +  typedef concepts::Graph Graph;
    1.27  
    1.28    typedef Graph::Edge Edge;
    1.29    typedef Graph::Node Node;
    1.30    typedef Graph::EdgeIt EdgeIt;
    1.31    typedef Graph::NodeIt NodeIt;
    1.32 -  typedef concept::ReadMap<Edge,VType> LengthMap;
    1.33 +  typedef concepts::ReadMap<Edge,VType> LengthMap;
    1.34     
    1.35    Graph g;
    1.36    dfs(g,Node()).run();
    1.37    dfs(g).source(Node()).run();
    1.38    dfs(g)
    1.39 -    .predMap(concept::WriteMap<Node,Edge>())
    1.40 -    .distMap(concept::WriteMap<Node,VType>())
    1.41 -    .reachedMap(concept::ReadWriteMap<Node,bool>())
    1.42 -    .processedMap(concept::WriteMap<Node,bool>())
    1.43 +    .predMap(concepts::WriteMap<Node,Edge>())
    1.44 +    .distMap(concepts::WriteMap<Node,VType>())
    1.45 +    .reachedMap(concepts::ReadWriteMap<Node,bool>())
    1.46 +    .processedMap(concepts::WriteMap<Node,bool>())
    1.47      .run(Node());
    1.48    
    1.49  }