Changeset 921:818510fa3d99 in lemon-0.x for src/test
- Timestamp:
- 09/29/04 17:30:04 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
- Location:
- src/test
- Files:
-
- 19 edited
Legend:
- Unmodified
- Added
- Removed
-
src/test/bfs_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/bfs_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/bfs_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include "test_tools.h" 18 #include < hugo/smart_graph.h>19 #include < hugo/bfs.h>20 #include< hugo/skeletons/graph.h>18 #include <lemon/smart_graph.h> 19 #include <lemon/bfs.h> 20 #include<lemon/skeletons/graph.h> 21 21 22 using namespace hugo;22 using namespace lemon; 23 23 24 24 const int PET_SIZE =5; -
src/test/dfs_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/dfs_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/dfs_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include "test_tools.h" 18 #include < hugo/smart_graph.h>19 #include < hugo/dfs.h>20 #include< hugo/skeletons/graph.h>18 #include <lemon/smart_graph.h> 19 #include <lemon/dfs.h> 20 #include<lemon/skeletons/graph.h> 21 21 22 using namespace hugo;22 using namespace lemon; 23 23 24 24 const int PET_SIZE =5; -
src/test/dijkstra_heap_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/dijkstra_heap_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/dijkstra_heap_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 20 20 21 21 //The input is a graph in standard dimacs format from the standard input (like 22 //in / hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both22 //in /lemon_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both 23 23 //heaps, checking two postconditions: 24 24 … … 31 31 #include <math.h> 32 32 33 #include < hugo/smart_graph.h>34 #include < hugo/dimacs.h>35 #include < hugo/dijkstra.h>36 #include < hugo/time_measure.h>37 #include < hugo/bin_heap.h>38 #include < hugo/fib_heap.h>33 #include <lemon/smart_graph.h> 34 #include <lemon/dimacs.h> 35 #include <lemon/dijkstra.h> 36 #include <lemon/time_measure.h> 37 #include <lemon/bin_heap.h> 38 #include <lemon/fib_heap.h> 39 39 40 using namespace hugo;40 using namespace lemon; 41 41 42 42 int main(int, char **) { -
src/test/dijkstra_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/dijkstra_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/dijkstra_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include "test_tools.h" 18 #include < hugo/smart_graph.h>19 #include < hugo/dijkstra.h>20 #include< hugo/skeletons/graph.h>21 #include< hugo/skeletons/maps.h>22 using namespace hugo;18 #include <lemon/smart_graph.h> 19 #include <lemon/dijkstra.h> 20 #include<lemon/skeletons/graph.h> 21 #include<lemon/skeletons/maps.h> 22 using namespace lemon; 23 23 24 24 const int PET_SIZE =5; -
src/test/error_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/error_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/error_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 17 17 #include <iostream> 18 18 19 #include < hugo/error.h>19 #include <lemon/error.h> 20 20 #include "test_tools.h" 21 using namespace hugo;21 using namespace lemon; 22 22 using std::cout; 23 23 using std::endl; -
src/test/graph_test.cc
r919 r921 1 1 /* -*- C++ -*- 2 * src/test/graph_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/graph_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include<iostream> 18 #include< hugo/smart_graph.h>19 #include< hugo/skeletons/graph.h>20 #include< hugo/list_graph.h>21 #include< hugo/full_graph.h>18 #include<lemon/smart_graph.h> 19 #include<lemon/skeletons/graph.h> 20 #include<lemon/list_graph.h> 21 #include<lemon/full_graph.h> 22 22 23 23 #include"test_tools.h" … … 34 34 */ 35 35 36 using namespace hugo;36 using namespace lemon; 37 37 38 38 template<class Graph> void bidirPetersen(Graph &G) … … 69 69 70 70 //Compile Graph 71 template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>71 template void lemon::checkCompileStaticGraph<skeleton::StaticGraph> 72 72 (skeleton::StaticGraph &); 73 73 74 template void hugo::checkCompileGraph<skeleton::ExtendableGraph>74 template void lemon::checkCompileGraph<skeleton::ExtendableGraph> 75 75 (skeleton::ExtendableGraph &); 76 76 77 template void hugo::checkCompileErasableGraph<skeleton::ErasableGraph>77 template void lemon::checkCompileErasableGraph<skeleton::ErasableGraph> 78 78 (skeleton::ErasableGraph &); 79 79 80 80 //Compile SmartGraph 81 template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);82 template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);81 template void lemon::checkCompileGraph<SmartGraph>(SmartGraph &); 82 template void lemon::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &); 83 83 84 84 //Compile SymSmartGraph 85 template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);86 template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);85 template void lemon::checkCompileGraph<SymSmartGraph>(SymSmartGraph &); 86 template void lemon::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &); 87 87 88 88 //Compile ListGraph 89 template void hugo::checkCompileGraph<ListGraph>(ListGraph &);90 template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);91 template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);89 template void lemon::checkCompileGraph<ListGraph>(ListGraph &); 90 template void lemon::checkCompileErasableGraph<ListGraph>(ListGraph &); 91 template void lemon::checkCompileGraphFindEdge<ListGraph>(ListGraph &); 92 92 93 93 94 94 //Compile SymListGraph 95 template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);96 template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);97 template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);95 template void lemon::checkCompileGraph<SymListGraph>(SymListGraph &); 96 template void lemon::checkCompileErasableGraph<SymListGraph>(SymListGraph &); 97 template void lemon::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &); 98 98 99 99 //Compile FullGraph 100 template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);101 template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);100 template void lemon::checkCompileStaticGraph<FullGraph>(FullGraph &); 101 template void lemon::checkCompileGraphFindEdge<FullGraph>(FullGraph &); 102 102 103 103 //Compile EdgeSet <ListGraph> 104 template void hugo::checkCompileGraph<EdgeSet <ListGraph> >104 template void lemon::checkCompileGraph<EdgeSet <ListGraph> > 105 105 (EdgeSet <ListGraph> &); 106 template void hugo::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >106 template void lemon::checkCompileGraphEraseEdge<EdgeSet <ListGraph> > 107 107 (EdgeSet <ListGraph> &); 108 template void hugo::checkCompileGraphFindEdge<EdgeSet <ListGraph> >108 template void lemon::checkCompileGraphFindEdge<EdgeSet <ListGraph> > 109 109 (EdgeSet <ListGraph> &); 110 110 111 111 //Compile EdgeSet <NodeSet> 112 template void hugo::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);113 template void hugo::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >112 template void lemon::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &); 113 template void lemon::checkCompileGraphEraseEdge<EdgeSet <NodeSet> > 114 114 (EdgeSet <NodeSet> &); 115 template void hugo::checkCompileGraphFindEdge<EdgeSet <NodeSet> >115 template void lemon::checkCompileGraphFindEdge<EdgeSet <NodeSet> > 116 116 (EdgeSet <NodeSet> &); 117 117 -
src/test/graph_test.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/test/graph_test.h - Part of HUGOlib, a generic C++ optimization library2 * src/test/graph_test.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 14 14 * 15 15 */ 16 #ifndef HUGO_TEST_GRAPH_TEST_H17 #define HUGO_TEST_GRAPH_TEST_H16 #ifndef LEMON_TEST_GRAPH_TEST_H 17 #define LEMON_TEST_GRAPH_TEST_H 18 18 19 19 … … 23 23 //! \file 24 24 //! \brief Some utility to test graph classes. 25 namespace hugo{25 namespace lemon { 26 26 27 27 struct DummyType { … … 320 320 321 321 322 } //namespace hugo322 } //namespace lemon 323 323 324 324 -
src/test/graph_wrapper_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/graph_wrapper_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include<iostream> 18 #include< hugo/smart_graph.h>19 #include< hugo/skeletons/graph.h>20 #include< hugo/list_graph.h>21 #include< hugo/full_graph.h>22 #include< hugo/graph_wrapper.h>18 #include<lemon/smart_graph.h> 19 #include<lemon/skeletons/graph.h> 20 #include<lemon/list_graph.h> 21 #include<lemon/full_graph.h> 22 #include<lemon/graph_wrapper.h> 23 23 24 24 #include"test/test_tools.h" … … 32 32 */ 33 33 34 using namespace hugo;34 using namespace lemon; 35 35 36 36 -
src/test/kruskal_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/kruskal_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/kruskal_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 19 19 20 20 #include "test_tools.h" 21 #include < hugo/maps.h>22 #include < hugo/kruskal.h>23 #include < hugo/list_graph.h>24 #include < hugo/skeletons/maps.h>25 #include < hugo/skeletons/graph.h>21 #include <lemon/maps.h> 22 #include <lemon/kruskal.h> 23 #include <lemon/list_graph.h> 24 #include <lemon/skeletons/maps.h> 25 #include <lemon/skeletons/graph.h> 26 26 27 27 28 28 using namespace std; 29 using namespace hugo;29 using namespace lemon; 30 30 31 31 void checkCompileKruskal() -
src/test/min_cost_flow_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/min_cost_flow_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/min_cost_flow_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 17 17 #include <iostream> 18 18 #include "test_tools.h" 19 #include < hugo/list_graph.h>20 #include < hugo/min_cost_flow.h>19 #include <lemon/list_graph.h> 20 #include <lemon/min_cost_flow.h> 21 21 //#include <path.h> 22 22 //#include <maps.h> 23 23 24 24 using namespace std; 25 using namespace hugo;25 using namespace lemon; 26 26 27 27 -
src/test/path_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/path_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/path_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 17 17 #include <string> 18 18 #include <iostream> 19 #include < hugo/skeletons/path.h>20 #include < hugo/path.h>21 #include < hugo/list_graph.h>19 #include <lemon/skeletons/path.h> 20 #include <lemon/path.h> 21 #include <lemon/list_graph.h> 22 22 23 23 using namespace std; 24 using namespace hugo;24 using namespace lemon; 25 25 using namespace skeleton; 26 26 -
src/test/preflow_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/preflow_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/preflow_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 19 19 20 20 #include "test_tools.h" 21 #include < hugo/smart_graph.h>22 #include < hugo/dimacs.h>23 #include < hugo/preflow.h>24 #include < hugo/skeletons/graph.h>25 #include < hugo/skeletons/maps.h>26 27 using namespace hugo;21 #include <lemon/smart_graph.h> 22 #include <lemon/dimacs.h> 23 #include <lemon/preflow.h> 24 #include <lemon/skeletons/graph.h> 25 #include <lemon/skeletons/maps.h> 26 27 using namespace lemon; 28 28 29 29 void check_Preflow() -
src/test/suurballe_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/suurballe_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/suurballe_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 16 16 17 17 #include <iostream> 18 #include < hugo/list_graph.h>19 #include < hugo/suurballe.h>18 #include <lemon/list_graph.h> 19 #include <lemon/suurballe.h> 20 20 //#include <path.h> 21 21 #include "test_tools.h" 22 22 23 23 using namespace std; 24 using namespace hugo;24 using namespace lemon; 25 25 26 26 -
src/test/test_tools.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/test/test_tools.h - Part of HUGOlib, a generic C++ optimization library2 * src/test/test_tools.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_TEST_TEST_TOOLS_H18 #define HUGO_TEST_TEST_TOOLS_H17 #ifndef LEMON_TEST_TEST_TOOLS_H 18 #define LEMON_TEST_TEST_TOOLS_H 19 19 20 20 //! \ingroup misc -
src/test/test_tools_fail.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/test_tools_fail.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/test_tools_fail.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport -
src/test/test_tools_pass.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/test_tools_pass.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/test_tools_pass.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport -
src/test/time_measure_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/time_measure_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/time_measure_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #include < hugo/time_measure.h>17 #include <lemon/time_measure.h> 18 18 19 19 ///\file \brief Test cases for time_measure.h … … 22 22 23 23 24 using namespace hugo;24 using namespace lemon; 25 25 26 26 int main() -
src/test/unionfind_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/unionfind_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/unionfind_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 17 17 #include <iostream> 18 18 19 #include < hugo/maps.h>20 #include < hugo/unionfind.h>19 #include <lemon/maps.h> 20 #include <lemon/unionfind.h> 21 21 #include "test_tools.h" 22 22 23 using namespace hugo;23 using namespace lemon; 24 24 using namespace std; 25 25 -
src/test/xy_test.cc
r906 r921 1 1 /* -*- C++ -*- 2 * src/test/xy_test.cc - Part of HUGOlib, a generic C++ optimization library2 * src/test/xy_test.cc - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #include < hugo/xy.h>17 #include <lemon/xy.h> 18 18 #include <iostream> 19 19 #include "test_tools.h" 20 20 21 21 using namespace std; 22 using namespace hugo;22 using namespace lemon; 23 23 int main() 24 24 {
Note: See TracChangeset
for help on using the changeset viewer.