COIN-OR::LEMON - Graph Library

source: lemon-0.x/src/work/bin_heap_demo.cc @ 549:5531429143bc

Last change on this file since 549:5531429143bc was 274:28728f3945c5, checked in by Mihaly Barasz, 17 years ago

bin_heap merge-olva

File size: 2.8 KB
Line 
1#include <iostream>
2#include <bin_heap.h>
3#include <string>
4#include <map>
5
6using namespace hugo;
7using namespace std;
8
9class string_int_map;
10
11// Egy binaris kupac, ami stringekhez rendelt double ertekeket tarol,
12// azaz mindig az a string van a tetejen, amihez a legkisebb szam tartozik.
13// A kupac egy string_int_map tipusu property_map segitsegevel tarolja
14// a stringek aktualis helyet sajatmagan belul.
15// Egy olyan stringhez, ami meg nincsen a kupac -1 -et kell rendelnunk.
16typedef BinHeap<string, double, string_int_map> StrDoubleHeap;
17
18class string_int_map : public map<string,int> {
19  typedef map<string,int> parent;
20public:
21  int get(const string &s) {
22    // Bocs, ez igy gaaaany, de nem volt kedvem utananezni, hogy
23    // hogy is mukodik ez a map :)
24    if( count(s) == 0 ) {
25      parent::operator[](s) = StrDoubleHeap::PRE_HEAP;
26    }
27    return parent::operator[](s);
28  }
29  int operator[](const string &s) {
30    return get(s);
31  }
32  void set(const string &s, int i) {
33      parent::operator[](s) = i;
34  }
35};
36
37
38int main()
39{
40  string_int_map sim;
41 
42 
43  cout << "testing string_int_map default value:\n";
44  cout << "  sim.get(\"alma\"): " << sim.get("alma") << endl;
45  cout << "  sim[\"alma\"]: " << sim["alma"] << endl;
46
47  cout << "creating the heap\n";
48  StrDoubleHeap heap(sim);
49
50  cout << "heap.push(\"alma\", 15);\n";
51  heap.push("alma", 15);
52
53  cout << "heap.set(\"korte\", 3.4);\n";
54  heap.set("korte", 3.4);
55
56  cout << "heap[\"alma\"] = "
57       << heap["alma"]
58       << endl;
59
60  cout << "heap.top() = "
61       << heap.top() << endl;
62  cout << "heap.prio() = "
63       << heap.prio() << endl;
64
65  cout << "heap.decrease(\"alma\", 1.2);\n";
66  heap.set("alma", 1.2);
67
68  cout << "heap.top() = "
69       << heap.top() << endl;
70  cout << "heap.prio() = "
71       << heap.prio() << endl;
72
73  cout << "heap.set(\"alma\", 22);\n";
74  heap.set("alma", 22);
75
76  cout << "heap.top() = "
77       << heap.top() << endl;
78  cout << "heap.prio() = "
79       << heap.prio() << endl;
80
81  cout << "heap.size() = "
82       << heap.size() << endl;
83  cout << "heap.pop();\n";
84  heap.pop();
85
86  cout << "heap.top() = "
87       << heap.top() << endl;
88  cout << "heap.prio() = "
89       << heap.prio() << endl;
90
91  cout << "heap.state(\"szilva\") = "
92       << heap.state("szilva") << endl;
93  cout << "heap.set(\"szilva\", 0.5);\n";
94  heap.set("szilva", 0.5);
95  cout << "heap.state(\"szilva\") = "
96       << heap.state("szilva") << endl;
97  cout << "heap.top() = "
98       << heap.top() << endl;
99  cout << "heap.pop();\n";
100  heap.pop();
101  cout << "heap.state(\"szilva\") = "
102       << heap.state("szilva") << endl;
103
104  cout << "heap.size() = "
105       << heap.size() << endl;
106  cout << "heap.pop();\n";
107  heap.pop();
108
109  cout << "heap.size() = "
110       << heap.size() << endl; 
111  cout << "heap.empty() = "
112       << (heap.empty()?"true":"false") << endl; 
113}
Note: See TracBrowser for help on using the repository browser.