graph_sfdp.hh 14.9 KB
Newer Older
Tiago Peixoto's avatar
Tiago Peixoto committed
1
2
// graph-tool -- a general graph modification and manipulation thingy
//
Tiago Peixoto's avatar
Tiago Peixoto committed
3
// Copyright (C) 2006-2013 Tiago de Paula Peixoto <tiago@skewed.de>
Tiago Peixoto's avatar
Tiago Peixoto committed
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
//
// 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 3
// 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, see <http://www.gnu.org/licenses/>.

#ifndef GRAPH_FDP_HH
#define GRAPH_FDP_HH

#include <limits>
#include <iostream>
Tiago Peixoto's avatar
Tiago Peixoto committed
23
24

#ifndef __clang__
25
26
#include <ext/numeric>
using __gnu_cxx::power;
Tiago Peixoto's avatar
Tiago Peixoto committed
27
28
29
30
31
32
33
#else
template <class Value>
Value power(Value value, int n)
{
    return pow(value, n);
}
#endif
Tiago Peixoto's avatar
Tiago Peixoto committed
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

namespace graph_tool
{
using namespace std;
using namespace boost;

template <class Pos, class Weight>
class QuadTree
{
public:
    QuadTree(const Pos& ll, const Pos& ur, int max_level)
        :_ll(ll), _ur(ur), _cm(2, 0), _count(0),
         _max_level(max_level)
    {
    }

    QuadTree& get_leaf(size_t i)
    {
        if (_max_level > 0 && _leafs.empty())
        {
            _leafs.reserve(4);
            for (size_t i = 0; i < 4; ++i)
            {
                Pos lll = _ll, lur = _ur;
                if (i % 2)
                    lll[0] += (_ur[0] - _ll[0]) / 2;
                else
                    lur[0] -= (_ur[0] - _ll[0]) / 2;
                if (i / 2)
                    lll[1] += (_ur[1] - _ll[1]) / 2;
                else
                    lur[1] -= (_ur[1] - _ll[1]) / 2;
                _leafs.push_back(QuadTree(lll, lur, _max_level - 1));
            }
        }

        return _leafs[i];
    }

Tiago Peixoto's avatar
Tiago Peixoto committed
73
    vector<std::tuple<Pos,Weight> >& get_dense_leafs()
Tiago Peixoto's avatar
Tiago Peixoto committed
74
75
76
77
78
79
80
81
82
83
84
85
86
87
    {
        return _dense_leafs;
    }

    size_t put_pos(Pos& p, Weight w)
    {
        _count += w;
        _cm[0] += p[0] * w;
        _cm[1] += p[1] * w;

        if (_max_level == 0)
        {
            if (_count == w)
                _dense_leafs.reserve(10);
Tiago Peixoto's avatar
Tiago Peixoto committed
88
            _dense_leafs.push_back(std::make_tuple(p, w));
Tiago Peixoto's avatar
Tiago Peixoto committed
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
            return 1;
        }
        else
        {
            int i = p[0] > (_ll[0] + (_ur[0] - _ll[0]) / 2);
            int j = p[1] > (_ll[1] + (_ur[1] - _ll[1]) / 2);
            size_t sc = (_max_level > 0 && _leafs.empty()) ? 4 : 0;
            return sc + get_leaf(i + 2 * j).put_pos(p, w);
        }
        return 0;
    }

    void get_cm(Pos& cm)
    {
        for (size_t i = 0; i < 2; ++i)
            cm[i] = _cm[i] / _count;
    }

    double get_w()
    {
Tiago Peixoto's avatar
Tiago Peixoto committed
109
110
        return sqrt(power(_ur[0] - _ll[0], 2) +
                    power(_ur[1] - _ll[1], 2));
Tiago Peixoto's avatar
Tiago Peixoto committed
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
    }

    Weight get_count()
    {
        return _count;
    }

    int max_level()
    {
        return _max_level;
    }

private:
    Pos _ll, _ur;
    vector<QuadTree> _leafs;
Tiago Peixoto's avatar
Tiago Peixoto committed
126
    vector<std::tuple<Pos,Weight> > _dense_leafs;
Tiago Peixoto's avatar
Tiago Peixoto committed
127
128
129
130
131
132
133
134
135
136
    Pos _cm;
    Weight _count;
    int _max_level;
};

template <class Pos>
inline double dist(const Pos& p1, const Pos& p2)
{
    double r = 0;
    for (size_t i = 0; i < 2; ++i)
Tiago Peixoto's avatar
Tiago Peixoto committed
137
        r += power(double(p1[i] - p2[i]), 2);
Tiago Peixoto's avatar
Tiago Peixoto committed
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
    return sqrt(r);
}

template <class Pos>
inline double f_r(double C, double K, double p, const Pos& p1, const Pos& p2)
{
    double d = dist(p1, p2);
    if (d == 0)
        return 0;
    return -C * pow(K, 1 + p) / pow(d, p);
}

template <class Pos>
inline double f_a(double K, const Pos& p1, const Pos& p2)
{
Tiago Peixoto's avatar
Tiago Peixoto committed
153
    return power(dist(p1, p2), 2) / K;
Tiago Peixoto's avatar
Tiago Peixoto committed
154
155
156
157
158
159
160
161
162
}

template <class Pos>
inline double get_diff(const Pos& p1, const Pos& p2, Pos& r)
{
    double abs = 0;
    for (size_t i = 0; i < 2; ++i)
    {
        r[i] = p1[i] - p2[i];
163
        abs += r[i] * r[i];
Tiago Peixoto's avatar
Tiago Peixoto committed
164
165
166
    }
    if (abs == 0)
        abs = 1;
167
    abs = sqrt(abs);
Tiago Peixoto's avatar
Tiago Peixoto committed
168
    for (size_t i = 0; i < 2; ++i)
169
170
        r[i] /= abs;
    return abs;
Tiago Peixoto's avatar
Tiago Peixoto committed
171
172
173
174
175
176
177
}

template <class Pos>
inline double norm(Pos& x)
{
    double abs = 0;
    for (size_t i = 0; i < 2; ++i)
Tiago Peixoto's avatar
Tiago Peixoto committed
178
        abs += power(x[i], 2);
Tiago Peixoto's avatar
Tiago Peixoto committed
179
180
181
182
183
184
185
    for (size_t i = 0; i < 2; ++i)
        x[i] /= sqrt(abs);
    return sqrt(abs);
}

struct get_sfdp_layout
{
186
    get_sfdp_layout(double C, double K, double p, double theta, double gamma,
187
188
189
190
191
192
193
194
195
                    double mu, double mu_p, double init_step,
                    double step_schedule, size_t max_level, double epsilon,
                    size_t max_iter, bool simple)
        : C(C), K(K), p(p), theta(theta), gamma(gamma), mu(mu), mu_p(mu_p),
          init_step(init_step), step_schedule(step_schedule),
          epsilon(epsilon), max_level(max_level), max_iter(max_iter),
          simple(simple) {}

    double C, K, p, theta, gamma, mu, mu_p, init_step, step_schedule, epsilon;
Tiago Peixoto's avatar
Tiago Peixoto committed
196
197
198
199
    size_t max_level, max_iter;
    bool simple;

    template <class Graph, class VertexIndex, class PosMap, class VertexWeightMap,
200
              class EdgeWeightMap, class PinMap, class GroupMap>
Tiago Peixoto's avatar
Tiago Peixoto committed
201
202
    void operator()(Graph& g, VertexIndex vertex_index, PosMap pos,
                    VertexWeightMap vweight, EdgeWeightMap eweight, PinMap pin,
203
                    GroupMap group, bool verbose) const
Tiago Peixoto's avatar
Tiago Peixoto committed
204
205
206
207
208
209
210
211
212
    {
        typedef typename property_traits<PosMap>::value_type pos_t;
        typedef typename property_traits<PosMap>::value_type::value_type val_t;

        typedef typename property_traits<VertexWeightMap>::value_type vweight_t;

        pos_t ll(2, numeric_limits<val_t>::max()),
            ur(2, -numeric_limits<val_t>::max());

213
        vector<pos_t> group_cm;
214
215
216
        vector<vweight_t> group_size;

        int i, N = num_vertices(g), HN=0;
Tiago Peixoto's avatar
Tiago Peixoto committed
217
218
219
220
221
222
        for (i = 0; i < N; ++i)
        {
            typename graph_traits<Graph>::vertex_descriptor v =
                vertex(i, g);
            if (v == graph_traits<Graph>::null_vertex())
                continue;
223
224
225
            pos[v].resize(2, 0);
            size_t s = group[v];

226
            if (s >= group_cm.size())
227
            {
228
229
                group_cm.resize(s + 1);
                group_size.resize(s + 1, 0);
230
            }
231
232
            group_cm[s].resize(2, 0);
            group_size[s] += get(vweight, v);
Tiago Peixoto's avatar
Tiago Peixoto committed
233
234
235
236
237

            for (size_t j = 0; j < 2; ++j)
            {
                ll[j] = min(pos[v][j], ll[j]);
                ur[j] = max(pos[v][j], ur[j]);
238
                group_cm[s][j] += pos[v][j] * get(vweight, v);
Tiago Peixoto's avatar
Tiago Peixoto committed
239
            }
240
241
242
243
244
            HN++;
        }

        for (size_t s = 0; s < group_size.size(); ++s)
        {
245
246
            if (group_size[s] == 0)
                continue;
247
248
249
            group_cm[s].resize(2, 0);
            for (size_t j = 0; j < 2; ++j)
                group_cm[s][j] /= group_size[s];
Tiago Peixoto's avatar
Tiago Peixoto committed
250
251
252
253
254
255
256
257
        }

        val_t delta = epsilon * K + 1, E = 0, E0;
        E0 = numeric_limits<val_t>::max();
        size_t n_iter = 0;
        val_t step = init_step;
        size_t progress = 0;

Tiago Peixoto's avatar
Tiago Peixoto committed
258
        vector<std::reference_wrapper<QuadTree<pos_t, vweight_t> > > Q;
Tiago Peixoto's avatar
Tiago Peixoto committed
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
        Q.reserve(max_level * 2);

        while (delta > epsilon * K && (max_iter == 0 || n_iter < max_iter))
        {
            delta = 0;
            E0 = E;
            E = 0;

            pos_t nll(2, numeric_limits<val_t>::max()),
                nur(2, -numeric_limits<val_t>::max());

            QuadTree<pos_t, vweight_t> qt(ll, ur, max_level);
            for (i = 0; i < N; ++i)
            {
                typename graph_traits<Graph>::vertex_descriptor v =
                    vertex(i, g);
                if (v == graph_traits<Graph>::null_vertex())
                    continue;
                qt.put_pos(pos[v], vweight[v]);
            }

            pos_t diff(2, 0), pos_u(2, 0), ftot(2, 0), cm(2, 0);

            size_t nmoves = 0;
            #pragma omp parallel for default(shared) private(i)  \
                firstprivate(Q, diff, pos_u, ftot, cm) \
285
                reduction(+:E, delta, nmoves) schedule(static) if (N > 100)
Tiago Peixoto's avatar
Tiago Peixoto committed
286
287
288
289
290
291
292
293
294
295
296
            for (i = 0; i < N; ++i)
            {
                typename graph_traits<Graph>::vertex_descriptor v =
                    vertex(i, g);
                if (v == graph_traits<Graph>::null_vertex())
                    continue;

                if (pin[v])
                    continue;

                ftot[0] = ftot[1] = 0;
297
298

                // global repulsive forces
Tiago Peixoto's avatar
Tiago Peixoto committed
299
                Q.clear();
Tiago Peixoto's avatar
Tiago Peixoto committed
300
                Q.push_back(std::ref(qt));
Tiago Peixoto's avatar
Tiago Peixoto committed
301
302
303
304
305
306
307
                while (!Q.empty())
                {
                    QuadTree<pos_t, vweight_t>& q = Q.back();
                    Q.pop_back();

                    if (q.max_level() == 0)
                    {
Tiago Peixoto's avatar
Tiago Peixoto committed
308
                        vector<std::tuple<pos_t,vweight_t> >& dleafs =
Tiago Peixoto's avatar
Tiago Peixoto committed
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
                            q.get_dense_leafs();
                        for(size_t j = 0; j < dleafs.size(); ++j)
                        {
                            val_t d = get_diff(get<0>(dleafs[j]), pos[v],
                                               diff);
                            if (d == 0)
                                continue;
                            val_t f = f_r(C, K, p, pos[v], get<0>(dleafs[j]));
                            f *= get<1>(dleafs[j]) * get(vweight, v);
                            for (size_t l = 0; l < 2; ++l)
                                ftot[l] += f * diff[l];
                        }
                    }
                    else
                    {
                        double w = q.get_w();
                        q.get_cm(cm);
                        double d = get_diff(cm, pos[v], diff);
327
                        if (w > theta * d)
Tiago Peixoto's avatar
Tiago Peixoto committed
328
329
330
331
332
                        {
                            for(size_t j = 0; j < 4; ++j)
                            {
                                QuadTree<pos_t, vweight_t>& leaf = q.get_leaf(j);
                                if (leaf.get_count() > 0)
Tiago Peixoto's avatar
Tiago Peixoto committed
333
                                    Q.push_back(std::ref(leaf));
Tiago Peixoto's avatar
Tiago Peixoto committed
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
                            }
                        }
                        else
                        {
                            if (d > 0)
                            {
                                val_t f = f_r(C, K, p, cm, pos[v]);
                                f *= q.get_count() * get(vweight, v);
                                for (size_t l = 0; l < 2; ++l)
                                    ftot[l] += f * diff[l];
                            }
                        }
                    }
                }

349
                // local attractive forces
Tiago Peixoto's avatar
Tiago Peixoto committed
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
                typename graph_traits<Graph>::out_edge_iterator e, e_end;
                for (tie(e,e_end) = out_edges(v, g); e != e_end; ++e)
                {
                    typename graph_traits<Graph>::vertex_descriptor u =
                        target(*e, g);
                    if (u == v)
                        continue;
                    {
                        #pragma omp critical
                        for (size_t l = 0; l < 2; ++l)
                            pos_u[l] = pos[u][l];
                    }
                    get_diff(pos_u, pos[v], diff);
                    val_t f = f_a(K, pos_u, pos[v]);
                    f *= get(eweight, *e) * get(vweight, u) * get(vweight, v);
                    for (size_t l = 0; l < 2; ++l)
                        ftot[l] += f * diff[l];
                }

369
                // inter-group attractive forces
370
                if (gamma > 0)
371
                {
372
373
374
375
376
377
378
379
380
                    for (size_t s = 0; s < group_cm.size(); ++s)
                    {
                        if (group_size[s] == 0)
                            continue;
                        if (s == size_t(group[v]))
                            continue;
                        val_t d = get_diff(group_cm[s], pos[v], diff);
                        if (d == 0)
                            continue;
Tiago Peixoto's avatar
Tiago Peixoto committed
381
                        double Kp = K * power(HN, 2);
382
383
384
385
386
                        val_t f = f_a(Kp, group_cm[s], pos[v]) * gamma * \
                            group_size[s] * get(vweight, v);
                        for (size_t l = 0; l < 2; ++l)
                            ftot[l] += f * diff[l];
                    }
387
388
                }

389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
                // inter-group repulsive forces
                if (gamma < 0)
                {
                    for (size_t s = 0; s < group_cm.size(); ++s)
                    {
                        if (group_size[s] == 0)
                            continue;
                        if (s == size_t(group[v]))
                            continue;
                        val_t d = get_diff(group_cm[s], pos[v], diff);
                        if (d == 0)
                            continue;
                        val_t f = f_r(C, K, p, cm, pos[v]);
                        f *= group_size[s] * get(vweight, v) * abs(gamma);
                        for (size_t l = 0; l < 2; ++l)
                            ftot[l] += f * diff[l];
                    }
                }

                // intra-group attractive forces
                if (group_size[group[v]] > 1 && mu > 0)
                {
                    val_t d = get_diff(group_cm[group[v]], pos[v], diff);
                    if (d > 0)
                    {
414
                        double Kp = K * pow(double(group_size[group[v]]), mu_p);
415
416
417
418
419
420
                        val_t f = f_a(Kp, group_cm[group[v]], pos[v]) * mu * \
                            group_size[group[v]] * get(vweight, v);
                        for (size_t l = 0; l < 2; ++l)
                            ftot[l] += f * diff[l];
                    }
                }
421

Tiago Peixoto's avatar
Tiago Peixoto committed
422
                E += power(norm(ftot), 2);
Tiago Peixoto's avatar
Tiago Peixoto committed
423
424
425
426
427

                {
                    #pragma omp critical
                    for (size_t l = 0; l < 2; ++l)
                    {
428
429
430
                        group_cm[group[v]][l] *= group_size[group[v]];
                        group_cm[group[v]][l] -= pos[v][l];

Tiago Peixoto's avatar
Tiago Peixoto committed
431
432
433
                        ftot[l] *= step;
                        pos[v][l] += ftot[l];

434
435
                        nll[l] = min(pos[v][l], nll[l]);
                        nur[l] = max(pos[v][l], nur[l]);
436

437
438
                        group_cm[group[v]][l] += pos[v][l];
                        group_cm[group[v]][l] /= group_size[group[v]];
Tiago Peixoto's avatar
Tiago Peixoto committed
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
                    }
                }
                delta += norm(ftot);
                nmoves++;
            }
            n_iter++;
            ll = nll;
            ur = nur;
            delta /= nmoves;

            if (verbose)
                cout << n_iter << " " << E << " " << step << " "
                     << delta << " " << max_level << endl;

            if (simple)
            {
                step *= step_schedule;
            }
            else
            {
                if (E < E0)
                {
                    ++progress;
                    if (progress >= 5)
                    {
                        progress = 0;
                        step /= step_schedule;
                    }
                }
                else
                {
                    progress = 0;
                    step *= step_schedule;
                }
            }
        }
    }
};

} // namespace graph_tool


#endif // GRAPH_FDP_HH