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