Files @ r604:8c3112a66878

Location: LEMON/LEMON-main/test/hao_orlin_test.cc

Load file history 
r604:8c3112a66878
1.4 KiB
text/x-c++src
Show annotation Show as raw Download as raw
gravatar
kpeter (Peter Kovacs)
Use XTI implementation instead of ATI in NetworkSimplex (#234) XTI (eXtended Threaded Index) is an imporved version of the widely known ATI (Augmented Threaded Index) method for storing and updating the spanning tree structure in Network Simplex algorithms. In the ATI data structure three indices are stored for each node: predecessor, thread and depth. In the XTI data structure depth is replaced by the number of successors and the last successor (according to the thread index).
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */



#include <sstream>



#include <lemon/smart_graph.h>

#include <lemon/hao_orlin.h>



#include <lemon/lgf_reader.h>

#include "test_tools.h"



using namespace lemon;

using namespace std;



const std::string lgf =

  "@nodes\n"

  "label\n"

  "0\n"

  "1\n"

  "2\n"

  "3\n"

  "4\n"

  "5\n"

  "@edges\n"

  "     label  capacity\n"

  "0 1  0      2\n"

  "1 2  1      2\n"

  "2 0  2      2\n"

  "3 4  3      2\n"

  "4 5  4      2\n"

  "5 3  5      2\n"

  "2 3  6      3\n";



int main() {

  SmartGraph graph;

  SmartGraph::EdgeMap<int> capacity(graph);



  istringstream lgfs(lgf);

  graphReader(graph, lgfs).

    edgeMap("capacity", capacity).run();



  HaoOrlin<SmartGraph, SmartGraph::EdgeMap<int> > ho(graph, capacity);

  ho.run();



  check(ho.minCutValue() == 3, "Wrong cut value");



  return 0;

}