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
|
#include <QtCore/QHash>
#include <QtCore/QQueue>
#include <QtCore/QString>
#include <QtCore/QDebug>
#include <float.h>
template <typename Vertex, typename EdgeData>
class Graph
{
public:
Graph() {}
class const_iterator {
public:
const_iterator(const Graph *graph, bool begin) : g(graph){
if (begin) {
row = g->m_graph.constBegin();
//test if the graph is empty
if (row != g->m_graph.constEnd())
{
column = (*row)->constBegin();
}
} else {
row = g->m_graph.constEnd();
}
}
inline Vertex *operator*() {
return column.key();
}
inline Vertex *from() const {
return row.key();
}
inline Vertex *to() const {
return column.key();
}
inline bool operator==(const const_iterator &o) const { return !(*this != o); }
inline bool operator!=(const const_iterator &o) const {
if (row == g->m_graph.end()) {
return row != o.row;
} else {
return row != o.row || column != o.column;
}
}
inline const_iterator& operator=(const const_iterator &o) const { row = o.row; column = o.column; return *this;}
// prefix
const_iterator &operator++() {
if (row != g->m_graph.constEnd()) {
++column;
if (column == (*row)->constEnd()) {
++row;
if (row != g->m_graph.constEnd()) {
column = (*row)->constBegin();
}
}
}
return *this;
}
private:
const Graph *g;
Q_TYPENAME QHash<Vertex *, QHash<Vertex *, EdgeData *> * >::const_iterator row;
Q_TYPENAME QHash<Vertex *, EdgeData *>::const_iterator column;
};
const_iterator constBegin() const {
return const_iterator(this,true);
}
const_iterator constEnd() const {
return const_iterator(this,false);
}
/*!
* \internal
*
* If there is an edge between \a first and \a second, it will return a structure
* containing the data associated with the edge, otherwise it will return 0.
*
*/
EdgeData *edgeData(Vertex* first, Vertex* second) {
QHash<Vertex *, EdgeData *> *row = m_graph.value(first);
return row ? row->value(second) : 0;
}
void createEdge(Vertex *first, Vertex *second, EdgeData *data)
{
// Creates a bidirectional edge
#if 0
qDebug("Graph::createEdge(): %s",
qPrintable(QString::fromAscii("%1-%2")
.arg(first->toString()).arg(second->toString())));
#endif
if (edgeData(first, second)) {
qWarning(qPrintable(QString::fromAscii("%1-%2 already has an edge")
.arg(first->toString()).arg(second->toString())));
}
createDirectedEdge(first, second, data);
createDirectedEdge(second, first, data);
}
void removeEdge(Vertex *first, Vertex *second)
{
// Removes a bidirectional edge
#if 0
qDebug("Graph::removeEdge(): %s",
qPrintable(QString::fromAscii("%1-%2")
.arg(first->toString()).arg(second->toString())));
#endif
EdgeData *data = edgeData(first, second);
removeDirectedEdge(first, second);
removeDirectedEdge(second, first);
if (data) delete data;
}
EdgeData *takeEdge(Vertex* first, Vertex* second)
{
#if 0
qDebug("Graph::takeEdge(): %s",
qPrintable(QString::fromAscii("%1-%2")
.arg(first->toString()).arg(second->toString())));
#endif
// Removes a bidirectional edge
EdgeData *data = edgeData(first, second);
if (data) {
removeDirectedEdge(first, second);
removeDirectedEdge(second, first);
}
return data;
}
QList<Vertex *> adjacentVertices(Vertex *vertex) const
{
QHash<Vertex *, EdgeData *> *row = m_graph.value(vertex);
QList<Vertex *> l;
if (row)
l = row->keys();
return l;
}
void setRootVertex(Vertex *vertex)
{
userVertex = vertex;
}
QSet<Vertex*> vertices() const {
QSet<Vertex *> setOfVertices;
for (const_iterator it = constBegin(); it != constEnd(); ++it) {
setOfVertices.insert(*it);
}
return setOfVertices;
}
QList<QPair<Vertex*, Vertex*> > connections() const {
QList<QPair<Vertex*, Vertex*> > conns;
for (const_iterator it = constBegin(); it != constEnd(); ++it) {
Vertex *from = it.from();
Vertex *to = it.to();
// do not return (from,to) *and* (to,from)
if (from < to) {
conns.append(qMakePair(from, to));
}
}
return conns;
}
QString serializeToDot() { // traversal
QString strVertices;
QString edges;
QSet<Vertex *> setOfVertices = vertices();
for (Q_TYPENAME QSet<Vertex*>::const_iterator it = setOfVertices.begin(); it != setOfVertices.end(); ++it) {
Vertex *v = *it;
QList<Vertex*> adjacents = adjacentVertices(v);
for (int i = 0; i < adjacents.count(); ++i) {
Vertex *v1 = adjacents.at(i);
EdgeData *data = edgeData(v, v1);
bool forward = data->from == v;
if (forward) {
edges += QString::fromAscii("%1->%2 [label=\"[%3,%4,%5]\" dir=both color=\"#000000:#a0a0a0\"] \n")
.arg(v->toString())
.arg(v1->toString())
.arg(data->minSize)
.arg(data->prefSize)
.arg(data->maxSize)
;
}
}
strVertices += QString::fromAscii("%1 [label=\"%2\"]\n").arg(v->toString()).arg(v->toString());
}
return QString::fromAscii("%1\n%2\n").arg(strVertices).arg(edges);
}
Vertex *rootVertex() const
{
return userVertex;
}
protected:
void createDirectedEdge(Vertex *from, Vertex *to, EdgeData *data)
{
QHash<Vertex *, EdgeData *> *adjacentToFirst = m_graph.value(from);
if (!adjacentToFirst) {
adjacentToFirst = new QHash<Vertex *, EdgeData *>();
m_graph.insert(from, adjacentToFirst);
}
adjacentToFirst->insert(to, data);
}
void removeDirectedEdge(Vertex *from, Vertex *to)
{
QHash<Vertex *, EdgeData *> *adjacentToFirst = m_graph.value(from);
Q_ASSERT(adjacentToFirst);
adjacentToFirst->remove(to);
if (adjacentToFirst->isEmpty()) {
//nobody point to 'from' so we can remove it from the graph
m_graph.remove(from);
delete adjacentToFirst;
}
}
private:
Vertex *userVertex;
QHash<Vertex *, QHash<Vertex *, EdgeData *> *> m_graph;
};
|
