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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
|
/* -*- mode: C++ -*- */
/*
IGraph library.
Copyright (C) 2011-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
// ****************************************************************************************************
// *** COPYRIGHT NOTICE *******************************************************************************
// rbtree - red-black tree (self-balancing binary tree data structure)
// Copyright (C) 2004 Aaron Clauset
//
// This program is free software; you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation; either version 2 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
//
// See http://www.gnu.org/licenses/gpl.txt for more details.
//
// ****************************************************************************************************
// Author : Aaron Clauset ( aaronc@santafe.edu | http://www.santafe.edu/~aaronc/ )
// Collaborators: Cristopher Moore and Mark Newman
// Project : Hierarchical Random Graphs
// Location : University of New Mexico, Dept. of Computer Science AND Santa Fe Institute
// Created : Spring 2004
// Modified : many, many times
//
// ****************************************************************************************************
#ifndef IGRAPH_HRG_RBTREE
#define IGRAPH_HRG_RBTREE
#include <iostream>
using namespace std;
namespace fitHRG {
// ******** Basic Structures *********************************************
#ifndef IGRAPH_HRG_LIST
#define IGRAPH_HRG_LIST
class list {
public:
int x; // stored elementd in linked-list
list* next; // pointer to next elementd
list(): x(-1), next(0) { }
~list() { }
};
#endif
class keyValuePair {
public:
int x; // elementrb key (int)
int y; // stored value (int)
keyValuePair* next; // linked-list pointer
keyValuePair(): x(-1), y(-1), next(0) { }
~keyValuePair() { }
};
// ******** Tree elementrb Class *****************************************
class elementrb {
public:
int key; // search key (int)
int value; // stored value (int)
bool color; // F: BLACK, T: RED
short int mark; // marker
elementrb *parent; // pointer to parent node
elementrb *left; // pointer for left subtree
elementrb *right; // pointer for right subtree
elementrb(): key(-1), value(-1), color(false), mark(0), parent(0),
left(0), right(0) { }
~elementrb() { }
};
// ******** Red-Black Tree Class *****************************************
// This vector implementation is a red-black balanced binary tree data
// structure. It provides find a stored elementrb in time O(log n),
// find the maximum elementrb in time O(1), delete an elementrb in
// time O(log n), and insert an elementrb in time O(log n).
//
// Note that the key=0 is assumed to be a special value, and thus you
// cannot insert such an item. Beware of this limitation.
class rbtree {
private:
elementrb* root; // binary tree root
elementrb* leaf; // all leaf nodes
int support; // number of nodes in the tree
void rotateLeft(elementrb *x); // left-rotation operator
void rotateRight(elementrb *y); // right-rotation operator
void insertCleanup(elementrb *z); // house-keeping after insertion
void deleteCleanup(elementrb *x); // house-keeping after deletion
keyValuePair* returnSubtreeAsList(elementrb *z, keyValuePair *head);
void deleteSubTree(elementrb *z); // delete subtree rooted at z
elementrb* returnMinKey(elementrb *z); // returns minimum of subtree
// rooted at z
elementrb* returnSuccessor(elementrb *z); // returns successor of z's key
public:
rbtree(); ~rbtree(); // default constructor/destructor
// returns value associated with searchKey
int returnValue(const int searchKey);
// returns T if searchKey found, and points foundNode at the
// corresponding node
elementrb* findItem(const int searchKey);
// insert a new key with stored value
void insertItem(int newKey, int newValue);
// selete a node with given key
void deleteItem(int killKey);
// replace value of a node with given key
void replaceItem(int key, int newValue);
// increment the value of the given key
void incrementValue(int key);
// delete the entire tree
void deleteTree();
// return array of keys in tree
int* returnArrayOfKeys();
// return list of keys in tree
list* returnListOfKeys();
// return the tree as a list of keyValuePairs
keyValuePair* returnTreeAsList();
// returns the maximum key in the tree
keyValuePair returnMaxKey();
// returns the minimum key in the tree
keyValuePair returnMinKey();
// returns number of items in tree
int returnNodecount();
};
}
#endif
|
