1.1 --- a/src/test/minlengthpaths_test.cc Wed Sep 22 07:22:34 2004 +0000
1.2 +++ /dev/null Thu Jan 01 00:00:00 1970 +0000
1.3 @@ -1,94 +0,0 @@
1.4 -#include <iostream>
1.5 -#include <hugo/list_graph.h>
1.6 -#include <hugo/minlengthpaths.h>
1.7 -//#include <path.h>
1.8 -#include "test_tools.h"
1.9 -
1.10 -using namespace std;
1.11 -using namespace hugo;
1.12 -
1.13 -
1.14 -
1.15 -bool passed = true;
1.16 -
1.17 -
1.18 -int main()
1.19 -{
1.20 -
1.21 - typedef ListGraph::Node Node;
1.22 - typedef ListGraph::Edge Edge;
1.23 -
1.24 - ListGraph graph;
1.25 -
1.26 - //Ahuja könyv példája
1.27 -
1.28 - Node s=graph.addNode();
1.29 - Node v1=graph.addNode();
1.30 - Node v2=graph.addNode();
1.31 - Node v3=graph.addNode();
1.32 - Node v4=graph.addNode();
1.33 - Node v5=graph.addNode();
1.34 - Node t=graph.addNode();
1.35 -
1.36 - Edge s_v1=graph.addEdge(s, v1);
1.37 - Edge v1_v2=graph.addEdge(v1, v2);
1.38 - Edge s_v3=graph.addEdge(s, v3);
1.39 - Edge v2_v4=graph.addEdge(v2, v4);
1.40 - Edge v2_v5=graph.addEdge(v2, v5);
1.41 - Edge v3_v5=graph.addEdge(v3, v5);
1.42 - Edge v4_t=graph.addEdge(v4, t);
1.43 - Edge v5_t=graph.addEdge(v5, t);
1.44 -
1.45 -
1.46 - ListGraph::EdgeMap<int> length(graph);
1.47 -
1.48 - length.set(s_v1, 6);
1.49 - length.set(v1_v2, 4);
1.50 - length.set(s_v3, 10);
1.51 - length.set(v2_v4, 5);
1.52 - length.set(v2_v5, 1);
1.53 - length.set(v3_v5, 5);
1.54 - length.set(v4_t, 8);
1.55 - length.set(v5_t, 8);
1.56 -
1.57 - std::cout << "Minlengthpaths algorithm test..." << std::endl;
1.58 -
1.59 -
1.60 - int k=3;
1.61 - MinLengthPaths< ListGraph, ListGraph::EdgeMap<int> >
1.62 - surb_test(graph, length);
1.63 -
1.64 - check( surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,
1.65 - "Two paths, total length should be 46");
1.66 -
1.67 - check( surb_test.checkComplementarySlackness(),
1.68 - "Complementary slackness conditions are not met.");
1.69 -
1.70 - // typedef DirPath<ListGraph> DPath;
1.71 - // DPath P(graph);
1.72 -
1.73 - /*
1.74 - surb_test.getPath(P,0);
1.75 - check(P.length() == 4, "First path should contain 4 edges.");
1.76 - cout<<P.length()<<endl;
1.77 - surb_test.getPath(P,1);
1.78 - check(P.length() == 3, "Second path: 3 edges.");
1.79 - cout<<P.length()<<endl;
1.80 - */
1.81 -
1.82 - k=1;
1.83 - check( surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,
1.84 - "One path, total length should be 19");
1.85 -
1.86 - check( surb_test.checkComplementarySlackness(),
1.87 - "Complementary slackness conditions are not met.");
1.88 -
1.89 - // surb_test.getPath(P,0);
1.90 - // check(P.length() == 4, "First path should contain 4 edges.");
1.91 -
1.92 - cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
1.93 - << endl;
1.94 -
1.95 - return passed ? 0 : 1;
1.96 -
1.97 -}