Must have been changed because of the private copy constructor.
authoralpar
Wed, 12 Jul 2006 11:40:52 +0000
changeset 213515355b98fb84
parent 2134 914602e294be
child 2136 4f64d6b3e9ec
Must have been changed because of the private copy constructor.
test/bfs_test.cc
test/dfs_test.cc
test/dijkstra_test.cc
test/kruskal_test.cc
     1.1 --- a/test/bfs_test.cc	Wed Jul 12 11:14:12 2006 +0000
     1.2 +++ b/test/bfs_test.cc	Wed Jul 12 11:40:52 2006 +0000
     1.3 @@ -74,9 +74,10 @@
     1.4    typedef Graph::NodeIt NodeIt;
     1.5    typedef concept::ReadMap<Edge,VType> LengthMap;
     1.6     
     1.7 -  bfs(Graph(),Node()).run();
     1.8 -  bfs(Graph()).source(Node()).run();
     1.9 -  bfs(Graph())
    1.10 +  Graph g;
    1.11 +  bfs(g,Node()).run();
    1.12 +  bfs(g).source(Node()).run();
    1.13 +  bfs(g)
    1.14      .predMap(concept::WriteMap<Node,Edge>())
    1.15      .distMap(concept::WriteMap<Node,VType>())
    1.16      .reachedMap(concept::ReadWriteMap<Node,bool>())
     2.1 --- a/test/dfs_test.cc	Wed Jul 12 11:14:12 2006 +0000
     2.2 +++ b/test/dfs_test.cc	Wed Jul 12 11:40:52 2006 +0000
     2.3 @@ -75,9 +75,10 @@
     2.4    typedef Graph::NodeIt NodeIt;
     2.5    typedef concept::ReadMap<Edge,VType> LengthMap;
     2.6     
     2.7 -  dfs(Graph(),Node()).run();
     2.8 -  dfs(Graph()).source(Node()).run();
     2.9 -  dfs(Graph())
    2.10 +  Graph g;
    2.11 +  dfs(g,Node()).run();
    2.12 +  dfs(g).source(Node()).run();
    2.13 +  dfs(g)
    2.14      .predMap(concept::WriteMap<Node,Edge>())
    2.15      .distMap(concept::WriteMap<Node,VType>())
    2.16      .reachedMap(concept::ReadWriteMap<Node,bool>())
     3.1 --- a/test/dijkstra_test.cc	Wed Jul 12 11:14:12 2006 +0000
     3.2 +++ b/test/dijkstra_test.cc	Wed Jul 12 11:40:52 2006 +0000
     3.3 @@ -78,9 +78,10 @@
     3.4    typedef Graph::NodeIt NodeIt;
     3.5    typedef concept::ReadMap<Edge,VType> LengthMap;
     3.6     
     3.7 -  dijkstra(Graph(),LengthMap(),Node()).run();
     3.8 -  dijkstra(Graph(),LengthMap()).source(Node()).run();
     3.9 -  dijkstra(Graph(),LengthMap())
    3.10 +  Graph g;
    3.11 +  dijkstra(g,LengthMap(),Node()).run();
    3.12 +  dijkstra(g,LengthMap()).source(Node()).run();
    3.13 +  dijkstra(g,LengthMap())
    3.14      .predMap(concept::WriteMap<Node,Edge>())
    3.15      .distMap(concept::WriteMap<Node,VType>())
    3.16      .run(Node());
     4.1 --- a/test/kruskal_test.cc	Wed Jul 12 11:14:12 2006 +0000
     4.2 +++ b/test/kruskal_test.cc	Wed Jul 12 11:40:52 2006 +0000
     4.3 @@ -34,7 +34,8 @@
     4.4  {
     4.5    concept::WriteMap<concept::Graph::Edge,bool> w;
     4.6  
     4.7 -  kruskal(concept::Graph(),
     4.8 +  concept::Graph g;
     4.9 +  kruskal(g,
    4.10  	  concept::ReadMap<concept::Graph::Edge,int>(),
    4.11  	  w);
    4.12  }