Changeset 2260:4274224f8a7d in lemon-0.x for test
- Timestamp:
- 10/24/06 19:19:16 (17 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3016
- Location:
- test
- Files:
-
- 16 edited
Legend:
- Unmodified
- Added
- Removed
-
test/bfs_test.cc
r2247 r2260 21 21 #include <lemon/bfs.h> 22 22 #include <lemon/path.h> 23 #include<lemon/concept /graph.h>23 #include<lemon/concepts/graph.h> 24 24 25 25 using namespace lemon; … … 30 30 void check_Bfs_Compile() 31 31 { 32 typedef concept ::Graph Graph;32 typedef concepts::Graph Graph; 33 33 34 34 typedef Graph::Edge Edge; … … 67 67 { 68 68 typedef int VType; 69 typedef concept ::Graph Graph;69 typedef concepts::Graph Graph; 70 70 71 71 typedef Graph::Edge Edge; … … 73 73 typedef Graph::EdgeIt EdgeIt; 74 74 typedef Graph::NodeIt NodeIt; 75 typedef concept ::ReadMap<Edge,VType> LengthMap;75 typedef concepts::ReadMap<Edge,VType> LengthMap; 76 76 77 77 Graph g; … … 79 79 bfs(g).source(Node()).run(); 80 80 bfs(g) 81 .predMap(concept ::WriteMap<Node,Edge>())82 .distMap(concept ::WriteMap<Node,VType>())83 .reachedMap(concept ::ReadWriteMap<Node,bool>())84 .processedMap(concept ::WriteMap<Node,bool>())81 .predMap(concepts::WriteMap<Node,Edge>()) 82 .distMap(concepts::WriteMap<Node,VType>()) 83 .reachedMap(concepts::ReadWriteMap<Node,bool>()) 84 .processedMap(concepts::WriteMap<Node,bool>()) 85 85 .run(Node()); 86 86 -
test/bpugraph_test.cc
r2231 r2260 17 17 */ 18 18 19 #include <lemon/concept /bpugraph.h>19 #include <lemon/concepts/bpugraph.h> 20 20 #include <lemon/list_graph.h> 21 21 #include <lemon/smart_graph.h> … … 29 29 30 30 using namespace lemon; 31 using namespace lemon::concept ;31 using namespace lemon::concepts; 32 32 33 33 void check_concepts() { -
test/dfs_test.cc
r2247 r2260 21 21 #include <lemon/dfs.h> 22 22 #include <lemon/path.h> 23 #include <lemon/concept /graph.h>23 #include <lemon/concepts/graph.h> 24 24 25 25 using namespace lemon; … … 30 30 void check_Dfs_SmartGraph_Compile() 31 31 { 32 typedef concept ::Graph Graph;32 typedef concepts::Graph Graph; 33 33 34 34 typedef Graph::Edge Edge; … … 68 68 { 69 69 typedef int VType; 70 typedef concept ::Graph Graph;70 typedef concepts::Graph Graph; 71 71 72 72 typedef Graph::Edge Edge; … … 74 74 typedef Graph::EdgeIt EdgeIt; 75 75 typedef Graph::NodeIt NodeIt; 76 typedef concept ::ReadMap<Edge,VType> LengthMap;76 typedef concepts::ReadMap<Edge,VType> LengthMap; 77 77 78 78 Graph g; … … 80 80 dfs(g).source(Node()).run(); 81 81 dfs(g) 82 .predMap(concept ::WriteMap<Node,Edge>())83 .distMap(concept ::WriteMap<Node,VType>())84 .reachedMap(concept ::ReadWriteMap<Node,bool>())85 .processedMap(concept ::WriteMap<Node,bool>())82 .predMap(concepts::WriteMap<Node,Edge>()) 83 .distMap(concepts::WriteMap<Node,VType>()) 84 .reachedMap(concepts::ReadWriteMap<Node,bool>()) 85 .processedMap(concepts::WriteMap<Node,bool>()) 86 86 .run(Node()); 87 87 -
test/dijkstra_test.cc
r2247 r2260 22 22 #include <lemon/path.h> 23 23 #include <lemon/maps.h> 24 #include <lemon/concept /graph.h>25 #include <lemon/concept /maps.h>24 #include <lemon/concepts/graph.h> 25 #include <lemon/concepts/maps.h> 26 26 using namespace lemon; 27 27 … … 32 32 { 33 33 typedef int VType; 34 typedef concept ::Graph Graph;34 typedef concepts::Graph Graph; 35 35 36 36 typedef Graph::Edge Edge; … … 38 38 typedef Graph::EdgeIt EdgeIt; 39 39 typedef Graph::NodeIt NodeIt; 40 typedef concept ::ReadMap<Edge,VType> LengthMap;40 typedef concepts::ReadMap<Edge,VType> LengthMap; 41 41 42 42 typedef Dijkstra<Graph, LengthMap> DType; … … 71 71 { 72 72 typedef int VType; 73 typedef concept ::Graph Graph;73 typedef concepts::Graph Graph; 74 74 75 75 typedef Graph::Edge Edge; … … 77 77 typedef Graph::EdgeIt EdgeIt; 78 78 typedef Graph::NodeIt NodeIt; 79 typedef concept ::ReadMap<Edge,VType> LengthMap;79 typedef concepts::ReadMap<Edge,VType> LengthMap; 80 80 81 81 Graph g; … … 83 83 dijkstra(g,LengthMap()).source(Node()).run(); 84 84 dijkstra(g,LengthMap()) 85 .predMap(concept ::WriteMap<Node,Edge>())86 .distMap(concept ::WriteMap<Node,VType>())85 .predMap(concepts::WriteMap<Node,Edge>()) 86 .distMap(concepts::WriteMap<Node,VType>()) 87 87 .run(Node()); 88 88 -
test/edge_set_test.cc
r2111 r2260 4 4 #include <vector> 5 5 6 #include <lemon/concept /graph.h>7 #include <lemon/concept /ugraph.h>6 #include <lemon/concepts/graph.h> 7 #include <lemon/concepts/ugraph.h> 8 8 #include <lemon/smart_graph.h> 9 9 … … 16 16 17 17 using namespace lemon; 18 using namespace lemon::concept ;18 using namespace lemon::concepts; 19 19 20 20 typedef SmartGraph RGraph; -
test/graph_adaptor_test.cc
r2231 r2260 21 21 22 22 #include<lemon/smart_graph.h> 23 #include<lemon/concept /graph.h>24 #include<lemon/concept /ugraph.h>25 #include<lemon/concept /bpugraph.h>23 #include<lemon/concepts/graph.h> 24 #include<lemon/concepts/ugraph.h> 25 #include<lemon/concepts/bpugraph.h> 26 26 27 27 #include<lemon/list_graph.h> … … 42 42 43 43 using namespace lemon; 44 using namespace lemon::concept ;44 using namespace lemon::concepts; 45 45 46 46 -
test/graph_factory_test.cc
r2111 r2260 19 19 #include<iostream> 20 20 #include<lemon/smart_graph.h> 21 #include<lemon/concept /graph.h>22 #include<lemon/concept /maps.h>21 #include<lemon/concepts/graph.h> 22 #include<lemon/concepts/maps.h> 23 23 #include<lemon/list_graph_base.h> 24 24 #include<lemon/full_graph.h> … … 71 71 72 72 //Compile Graph 73 template void lemon::concept ::checkCompileGraph<concept::Graph>74 (concept ::Graph &);73 template void lemon::concepts::checkCompileGraph<concepts::Graph> 74 (concepts::Graph &); 75 75 76 76 template 77 void lemon::concept ::checkCompileGraph<concept::Graph>78 (concept ::Graph &);77 void lemon::concepts::checkCompileGraph<concepts::Graph> 78 (concepts::Graph &); 79 79 80 80 template 81 void lemon::concept ::checkCompileGraph<concept::Graph>82 (concept ::Graph &);81 void lemon::concepts::checkCompileGraph<concepts::Graph> 82 (concepts::Graph &); 83 83 84 84 //Compile SmartGraph 85 85 template 86 void lemon::concept ::checkCompileGraph<SmartGraph>(SmartGraph &);86 void lemon::concepts::checkCompileGraph<SmartGraph>(SmartGraph &); 87 87 template 88 void lemon::concept ::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);88 void lemon::concepts::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &); 89 89 90 90 //Compile SymSmartGraph … … 94 94 //Compile ListGraph 95 95 template 96 void lemon::concept ::checkCompileGraph<ListGraph>(ListGraph &);96 void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &); 97 97 template 98 void lemon::concept ::checkCompileGraph<ListGraph>(ListGraph &);98 void lemon::concepts::checkCompileGraph<ListGraph>(ListGraph &); 99 99 template 100 void lemon::concept ::checkCompileGraphFindEdge<ListGraph>(ListGraph &);100 void lemon::concepts::checkCompileGraphFindEdge<ListGraph>(ListGraph &); 101 101 102 102 … … 107 107 108 108 //Compile FullGraph 109 template void lemon::concept ::checkCompileGraph<FullGraph>(FullGraph &);109 template void lemon::concepts::checkCompileGraph<FullGraph>(FullGraph &); 110 110 template 111 void lemon::concept ::checkCompileGraphFindEdge<FullGraph>(FullGraph &);111 void lemon::concepts::checkCompileGraphFindEdge<FullGraph>(FullGraph &); 112 112 113 113 … … 144 144 // Some map tests. 145 145 // FIXME: These shouldn't be here. 146 using namespace concept ;146 using namespace concepts; 147 147 function_requires< ReadMapConcept< ReadMap<int,int> > >(); 148 148 function_requires< WriteMapConcept< WriteMap<int,int> > >(); -
test/graph_test.cc
r2231 r2260 20 20 #include <vector> 21 21 22 #include <lemon/concept /graph.h>22 #include <lemon/concepts/graph.h> 23 23 #include <lemon/list_graph.h> 24 24 #include <lemon/smart_graph.h> … … 32 32 33 33 using namespace lemon; 34 using namespace lemon::concept ;34 using namespace lemon::concepts; 35 35 36 36 -
test/heap_test.cc
r2108 r2260 23 23 24 24 #include <lemon/concept_check.h> 25 #include <lemon/concept /heap.h>25 #include <lemon/concepts/heap.h> 26 26 27 27 #include <lemon/smart_graph.h> … … 41 41 42 42 using namespace lemon; 43 using namespace lemon::concept ;43 using namespace lemon::concepts; 44 44 45 45 -
test/kruskal_test.cc
r2135 r2260 24 24 #include <lemon/kruskal.h> 25 25 #include <lemon/list_graph.h> 26 #include <lemon/concept /maps.h>27 #include <lemon/concept /graph.h>26 #include <lemon/concepts/maps.h> 27 #include <lemon/concepts/graph.h> 28 28 29 29 … … 33 33 void checkCompileKruskal() 34 34 { 35 concept ::WriteMap<concept::Graph::Edge,bool> w;35 concepts::WriteMap<concepts::Graph::Edge,bool> w; 36 36 37 concept ::Graph g;37 concepts::Graph g; 38 38 kruskal(g, 39 concept ::ReadMap<concept::Graph::Edge,int>(),39 concepts::ReadMap<concepts::Graph::Edge,int>(), 40 40 w); 41 41 } -
test/maps_test.cc
r2032 r2260 21 21 22 22 #include <lemon/concept_check.h> 23 #include <lemon/concept /maps.h>23 #include <lemon/concepts/maps.h> 24 24 #include <lemon/maps.h> 25 25 … … 27 27 28 28 using namespace lemon; 29 using namespace lemon::concept ;29 using namespace lemon::concepts; 30 30 31 31 struct A {}; -
test/matrix_maps_test.cc
r2242 r2260 22 22 #include <lemon/concept_check.h> 23 23 24 #include <lemon/concept /matrix_maps.h>25 #include <lemon/concept /maps.h>26 #include <lemon/concept /graph.h>24 #include <lemon/concepts/matrix_maps.h> 25 #include <lemon/concepts/maps.h> 26 #include <lemon/concepts/graph.h> 27 27 28 28 #include <lemon/matrix_maps.h> … … 36 36 37 37 using namespace lemon; 38 using namespace lemon::concept ;38 using namespace lemon::concepts; 39 39 40 40 int main() { -
test/path_test.cc
r2247 r2260 20 20 #include <iostream> 21 21 22 #include <lemon/concept /path.h>23 #include <lemon/concept /graph.h>22 #include <lemon/concepts/path.h> 23 #include <lemon/concepts/graph.h> 24 24 25 25 #include <lemon/path.h> … … 32 32 33 33 void check_concepts() { 34 checkConcept<concept ::Path<concept::Graph>,35 concept ::Path<concept::Graph> >();36 checkConcept<concept ::Path<concept::Graph>,37 Path<concept ::Graph> >();38 checkConcept<concept ::Path<ListGraph>, Path<ListGraph> >();34 checkConcept<concepts::Path<concepts::Graph>, 35 concepts::Path<concepts::Graph> >(); 36 checkConcept<concepts::Path<concepts::Graph>, 37 Path<concepts::Graph> >(); 38 checkConcept<concepts::Path<ListGraph>, Path<ListGraph> >(); 39 39 } 40 40 -
test/preflow_test.cc
r2111 r2260 24 24 #include <lemon/dimacs.h> 25 25 #include <lemon/preflow.h> 26 #include <lemon/concept /graph.h>27 #include <lemon/concept /maps.h>26 #include <lemon/concepts/graph.h> 27 #include <lemon/concepts/maps.h> 28 28 29 29 using namespace lemon; … … 32 32 { 33 33 typedef int VType; 34 typedef concept ::Graph Graph;34 typedef concepts::Graph Graph; 35 35 36 36 typedef Graph::Node Node; 37 37 typedef Graph::Edge Edge; 38 typedef concept ::ReadMap<Edge,VType> CapMap;39 typedef concept ::ReadWriteMap<Edge,VType> FlowMap;40 typedef concept ::ReadWriteMap<Node,bool> CutMap;38 typedef concepts::ReadMap<Edge,VType> CapMap; 39 typedef concepts::ReadWriteMap<Edge,VType> FlowMap; 40 typedef concepts::ReadWriteMap<Node,bool> CutMap; 41 41 42 42 typedef Preflow<Graph, int, CapMap, FlowMap> PType; -
test/test_tools.h
r2242 r2260 27 27 28 28 #include <lemon/concept_check.h> 29 #include <lemon/concept /graph.h>29 #include <lemon/concepts/graph.h> 30 30 31 31 #include <lemon/random.h> -
test/ugraph_test.cc
r2231 r2260 18 18 19 19 #include <lemon/bits/graph_extender.h> 20 #include <lemon/concept /ugraph.h>20 #include <lemon/concepts/ugraph.h> 21 21 #include <lemon/list_graph.h> 22 22 #include <lemon/smart_graph.h> … … 30 30 31 31 using namespace lemon; 32 using namespace lemon::concept ;32 using namespace lemon::concepts; 33 33 34 34 void check_concepts() {
Note: See TracChangeset
for help on using the changeset viewer.