forked from holubecmichal/MemGraph
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathgraph_component.h
384 lines (325 loc) · 8.92 KB
/
graph_component.h
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
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
/////////////////////////////////////////////////////////////////////////
//
// Bakalářská práce
// Vizualizace datových struktur pro verifikační nástroje
// Michael Holubec
// GNU LGPLv3
//
//////////////////////////////////////////////////////////////////////////
//
// Created by Michael Holubec on 21.02.16.
//
#ifndef MEMGRAPH_GRAPHCOMPONENT_H
#define MEMGRAPH_GRAPHCOMPONENT_H
#include <vector>
#include "node.h"
#include "edge.h"
#include <typeinfo>
namespace memgraph {
class Subgraph;
typedef std::map<std::string, Subgraph *> subgraphs_map;
typedef subgraphs_map::iterator subgraphs_it;
typedef std::pair<std::string, Subgraph *> subgraphs_pair;
typedef std::vector<Subgraph *> subgraphs_vect;
class GraphComponent {
private:
// mnozina vrcholu grafu
nodes_map nodes;
// mnozina hran grafu
edges_vect edges;
// mnozina pografu grafu
subgraphs_map subgraphs;
// atributy vrcholu grafu
Attributes node_attrs;
// atributy hran grafu
Attributes edge_attrs;
/**
* metoda pro vlozeni hrany do mnoziny hran
* @param Edge *edge ukazatel na vkladanou hranu
*/
void insertEdge(Edge *edge);
/**
* kontroluje, zda ukazatel na objekt neni ukazatelem na NULL
* @param typename T object objekt
*/
template<typename T>
void checkNullObject(T *object) {
if (object == NULL) {
throw "Type of " + std::string(typeid(T).name()) + " - object is NULL";
}
}
/**
* pomocna metoda pro destruktor komponenty grafu
* @param subgraphs_map *subgraphs mnozina podgrafu
*/
static void destructSubgraphs(subgraphs_map *subgraphs);
protected:
// ukazatel na rodice grafu
GraphComponent *parent = NULL;
/**
* pomocna metoda pro nalezeni vrcholu v podgrafech
* @param std::string name nazev vrchol
*/
Node *getNodeInSubgraphs(std::string name);
/**
* pomocna metoda pro nalezeni vrcholu v podgrafech
* @param std::string name nazev vrchol
*/
Node *getLocalNode(std::string name);
/**
* vraci root celeho grafu
*/
GraphComponent *getMainParent();
/**
* udrzuje dostupne atributy grafu
*/
static string_vector available_attrs;
/**
* pomocna metoda pro vypis upozorneni neexistence atributu grafu ve staticke promenne available_attrs
* @param std::string nazev vlozeneho atributu
*/
static void printWarning(std::string name);
/**
* kontroluje existenci atributu ve staticke promenne available_attrs
* @param std::string nazev vlozeneho atributu
*/
static bool isAvailableAttr(std::string name);
public:
// mnozina atributu grafu
Attributes attrs;
// umoznuje vypnuti vypisu upozorneni na neexistenci atributu v hranach, grafech i vrcholech
static bool enable_warnings;
~GraphComponent() {
destructSubgraphs(&subgraphs);
for (auto i : nodes) {
Node *node = i.second;
delete node;
}
for (auto edge : edges) {
delete edge;
}
}
// ===== GRAPH_COMPONENT METHODS =====
/**
* nastaveni atributu grafu
* @param Attributes *new_attrs atributy
*/
void setAttrs(Attributes *new_attrs);
/**
* nastaveni atributu grafu
* @param Attribute *attr ukazatel na atribut
* @return GraphComponent*
*/
GraphComponent *setAttr(Attribute *attr) {
checkAttr(attr->getName());
attrs.setAttr(attr);
return this;
}
/**
* nastaveni atributu grafu
* @param std::string name identifikator
* @param typename T value hodnota
* @return GraphComponent*
*/
template<typename T>
GraphComponent *setAttr(std::string name, T value) {
checkAttr(name);
attrs.setAttr(name, value);
return this;
}
/**
* nastaveni atributu grafu a jeho oznaceni za HTML
* @param std::string name identifikator
* @param typename T value hodnota
* @return GraphComponent*
*/
template<typename T>
GraphComponent *setHtmlAttr(std::string name, T value) {
checkAttr(name);
attrs.setHtmlAttr(name, value);
return this;
}
// ===== SUBGRAPHS METHODS ======
/**
* prida podgraf
* @param std::string name nazev podgrafu
* @return Subgraph* ukazatel na instanci Subgraph
*/
Subgraph *addSubgraph(std::string name);
/**
* vrati komponentu podgrafu
* @param std::string name nazev hledaneho podgrafu
* @return Subgraph*|NULL
*/
Subgraph *getSubgraph(std::string name);
// ===== NODES METHODS =====
/**
* prida vrchol do komponenty grafu
* @param std::string name nazev vrcholu
* @return Node* ukazatel na instanci Node
*/
Node *addNode(std::string name);
/**
* prida vrchol do komponenty grafu
* @param Node *node ukazatel na instanci Node
* @return Node* ukazatel na instanci Node
*/
Node *addNode(Node *node);
/**
* vrati vrchol, ktery vyhledava v celem prostoru grafu
* @param std::string name nazev vrcholu
* @return Node*|NULL
*/
Node *getNode(std::string name);
// metoda urcena pouze pro prekladac
Node *getNode(Node *node) {
return node;
}
// ===== EDGES METHODS =====
/**
* prida hranu do komponenty grafu
* @param Edge *edge ukazatel na instanci hrany
* @return Edge*
*/
Edge *addEdge(Edge *edge);
/**
* vytvori a prida hranu do komponenty grafu
* @param std::string from nazev vrcholu
* @param std::string to nazev vrcholu
* @return Edge*
*/
Edge *addEdge(std::string from, std::string to);
/**
* vytvori a prida hranu do komponenty grafu
* @param Node *from ukazatel na instanci Node
* @param Node *to ukazatel na instanci Node
* @return Edge*
*/
Edge *addEdge(Node *from, Node *to);
/**
* vyhleda a vrati ukazatel na instanci hrany podle vrcholu
* @param Node *from
* @param Node *to
* @return Edge*
*/
Edge *getEdge(Node *from, Node *to);
/**
* vyhleda a vrati ukazatel na instanci hrany podle vrcholu
* @param std::string from nazev vrcholu
* @param std::string to nazev vrcholu
* @return Edge*
*/
Edge *getEdge(std::string from, std::string to);
// ===== NODE ATTRIBUTES METHODS =====
/**
* nastaveni defaultniho atributu pro vrcholy komponenty grafu
* @param std::string name identifikator
* @param typename T hodnota
*/
template<typename T>
void setNodeAttr(std::string name, T value) {
Node::checkAttr(name);
node_attrs.setAttr(name, value);
}
/**
* nastaveni defaultniho atributu pro vrcholy komponenty grafu
* @param Attribute *attr
*/
void setNodeAttr(Attribute *attr);
/**
* nastaveni defaultni mnoziny atributu pro vrcholy komponenty grafu
* @param Attributes *attrs
*/
void setNodeAttrs(Attributes *attrs);
// ===== EDGE ATTRIBUTES METHODS =====
/**
* nastaveni defaultniho atributu pro vrcholy komponenty grafu
* @param std::string name identifikator
* @param typename T hodnota
*/
template<typename T>
void setEdgeAttr(std::string name, T value) {
Edge::checkAttr(name);
edge_attrs.setAttr(name, value);
}
/**
* nastaveni defaultniho atributu pro hrany komponenty grafu
* @param Attribute *attr
*/
void setEdgeAttr(Attribute *attr);
/**
* nastaveni defaultni mnoziny atributu pro hrany komponenty grafu
* @param Attributes *attrs
*/
void setEdgeAttrs(Attributes *attrs);
// ===== OTHERS =====
/**
* vraci mnozinu vrcholu komponenty grafu
* @return nodes_map*
*/
nodes_map *getNodes() { return &nodes; }
/**
* vraci mnozinu hran komponenty grafu
* @return edges_vect*
*/
edges_vect *getEdges() { return &edges; }
/**
* vraci mnozinu podgrafu komponenty grafu
* @return subgraphs_map*
*/
subgraphs_map *getSubgraphs() { return &subgraphs; }
/**
* vraci mnozinu defaultnich atributu vrcholu komponenty grafu
* @return Attributes*
*/
Attributes *getNodeAttrs() { return &node_attrs; }
/**
* vraci mnozinu defaultnich atributu hran komponenty grafu
* @return Attributes*
*/
Attributes *getEdgeAttrs() { return &edge_attrs; }
/**
* vraci mnozinu atributu komponenty grafu
* @return Attributes*
*/
Attributes *getAttrs() { return &attrs; }
/**
* vraci atribut komponenty grafu
* @return Attribute*
*/
Attribute *getAttr(std::string name) { return attrs.getAttr(name); }
/**
* kontroluje existenci identifikatoru atributu v mnozine povolenych atributu
* @param std::string name identifikator
*/
static void checkAttr(std::string name);
/**
* nastavi mnozinu povolenych atributu
* @param string_vector attrs mnozina povolenych atributu
*/
static void setAvailableAttrs(string_vector attrs) {
available_attrs = attrs;
}
};
class Subgraph : public GraphComponent {
private:
std::string name;
public:
Subgraph(GraphComponent *parent) { this->parent = parent; };
Subgraph(GraphComponent *parent, std::string name) {
this->parent = parent;
this->name = name;
}
/**
* vraci identifikator podgrafu
* @return const char *
*/
const char *getName();
/**
* nastavi identifikator podgrafu
* @param std::string value
*/
void setName(std::string value);
};
}
#endif //MEMGRAPH_GRAPHCOMPONENT_H