graph_complete.hh 2.12 KB
Newer Older
Tiago Peixoto's avatar
Tiago Peixoto committed
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
// graph-tool -- a general graph modification and manipulation thingy
//
// Copyright (C) 2006-2013 Tiago de Paula Peixoto <tiago@skewed.de>
//
// 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_COMPLETE_HH
#define GRAPH_COMPLETE_HH

#include <iostream>
#include "graph_util.hh"

namespace graph_tool
{
using namespace std;
using namespace boost;

struct get_complete
{
    template <class Graph>
    void operator()(Graph& g, size_t N, bool directed, bool self_loops) const
    {
        for (int i = 0; i < N; ++i)
            add_vertex(g);

        for (int i = 0; i < N; ++i)
        {
Tiago Peixoto's avatar
Tiago Peixoto committed
39
            for (int j = directed ? 0 : i; j < N; ++j)
Tiago Peixoto's avatar
Tiago Peixoto committed
40
41
42
            {
                if (!self_loops && j == i)
                    continue;
Tiago Peixoto's avatar
Tiago Peixoto committed
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
                add_edge(vertex(i, g),
                         vertex(j, g), g);
            }
        }
    }
};

struct get_circular
{
    template <class Graph>
    void operator()(Graph& g, size_t N, size_t k, bool directed,
                    bool self_loops) const
    {
        for (int i = 0; i < N; ++i)
            add_vertex(g);

        for (int i = 0; i < N; ++i)
        {
            for (int j = i; j < i + k + 1; ++j)
            {
                if (!self_loops && j == i)
                    continue;
                add_edge(vertex(i, g),
                         vertex(j % N, g), g);
                if (directed && j != i)
                    add_edge(vertex(j % N, g),
                             vertex(i, g), g);
Tiago Peixoto's avatar
Tiago Peixoto committed
70
71
72
73
74
75
76
77
            }
        }
    }
};

} // namespace graph_tool

#endif // GRAPH_COMPLETE_HH