COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/test/suurballe_test.cc @ 940:50a153b08f07

Last change on this file since 940:50a153b08f07 was 921:818510fa3d99, checked in by Alpar Juttner, 15 years ago

hugo -> lemon

File size: 2.7 KB
Line 
1/* -*- C++ -*-
2 * src/test/suurballe_test.cc - Part of LEMON, a generic C++ optimization library
3 *
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
5 * (Egervary Combinatorial Optimization Research Group, EGRES).
6 *
7 * Permission to use, modify and distribute this software is granted
8 * provided that this copyright notice appears in all copies. For
9 * precise terms see the accompanying LICENSE file.
10 *
11 * This software is provided "AS IS" with no warranty of any kind,
12 * express or implied, and with no claim as to its suitability for any
13 * purpose.
14 *
15 */
16
17#include <iostream>
18#include <lemon/list_graph.h>
19#include <lemon/suurballe.h>
20//#include <path.h>
21#include "test_tools.h"
22
23using namespace std;
24using namespace lemon;
25
26
27
28bool passed = true;
29
30
31int main()
32{
33
34  typedef ListGraph::Node Node;
35  typedef ListGraph::Edge Edge;
36
37  ListGraph graph;
38
39  //Ahuja könyv példája
40
41  Node s=graph.addNode();
42  Node v1=graph.addNode(); 
43  Node v2=graph.addNode();
44  Node v3=graph.addNode();
45  Node v4=graph.addNode();
46  Node v5=graph.addNode();
47  Node t=graph.addNode();
48
49  Edge s_v1=graph.addEdge(s, v1);
50  Edge v1_v2=graph.addEdge(v1, v2);
51  Edge s_v3=graph.addEdge(s, v3);
52  Edge v2_v4=graph.addEdge(v2, v4);
53  Edge v2_v5=graph.addEdge(v2, v5);
54  Edge v3_v5=graph.addEdge(v3, v5);
55  Edge v4_t=graph.addEdge(v4, t);
56  Edge v5_t=graph.addEdge(v5, t);
57 
58
59  ListGraph::EdgeMap<int> length(graph);
60
61  length.set(s_v1, 6);
62  length.set(v1_v2, 4);
63  length.set(s_v3, 10);
64  length.set(v2_v4, 5);
65  length.set(v2_v5, 1);
66  length.set(v3_v5, 5);
67  length.set(v4_t, 8);
68  length.set(v5_t, 8);
69
70  std::cout << "Minlengthpaths algorithm test..." << std::endl;
71
72 
73  int k=3;
74  Suurballe< ListGraph, ListGraph::EdgeMap<int> >
75    surb_test(graph, length);
76
77  check(  surb_test.run(s,t,k) == 2 && surb_test.totalLength() == 46,
78          "Two paths, total length should be 46");
79
80  check(  surb_test.checkComplementarySlackness(),
81          "Complementary slackness conditions are not met.");
82
83  //  typedef DirPath<ListGraph> DPath;
84  //  DPath P(graph);
85
86  /*
87  surb_test.getPath(P,0);
88  check(P.length() == 4, "First path should contain 4 edges."); 
89  cout<<P.length()<<endl;
90  surb_test.getPath(P,1);
91  check(P.length() == 3, "Second path: 3 edges.");
92  cout<<P.length()<<endl;
93  */ 
94
95  k=1;
96  check(  surb_test.run(s,t,k) == 1 && surb_test.totalLength() == 19,
97          "One path, total length should be 19");
98
99  check(  surb_test.checkComplementarySlackness(),
100          "Complementary slackness conditions are not met.");
101 
102  //  surb_test.getPath(P,0);
103  //  check(P.length() == 4, "First path should contain 4 edges."); 
104
105  cout << (passed ? "All tests passed." : "Some of the tests failed!!!")
106       << endl;
107
108  return passed ? 0 : 1;
109
110}
Note: See TracBrowser for help on using the repository browser.