graph_community_network.cc 4.76 KB
Newer Older
1
2
// graph-tool -- a general graph modification and manipulation thingy
//
Tiago Peixoto's avatar
Tiago Peixoto committed
3
// Copyright (C) 2006-2017 Tiago de Paula Peixoto <tiago@skewed.de>
4
5
6
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License
Tiago Peixoto's avatar
Tiago Peixoto committed
7
// as published by the Free Software Foundation; either version 3
8
9
10
11
12
13
14
15
// 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
16
17
// along with this program. If not, see <http://www.gnu.org/licenses/>.

18
#include "graph_python_interface.hh"
19
20
21
22
23
#include "graph_filtering.hh"
#include "graph.hh"
#include "graph_selectors.hh"
#include "graph_properties.hh"

24
25
26
27
#include <boost/bind.hpp>
#include <boost/bind/placeholders.hpp>
#include <boost/mpl/push_back.hpp>
#include <boost/python.hpp>
28

29
#include "graph_community_network.hh"
30
31
32

using namespace std;
using namespace boost;
33

34
35
using namespace graph_tool;

36
37
typedef UnityPropertyMap<int,GraphInterface::edge_t> no_eweight_map_t;
typedef UnityPropertyMap<int,GraphInterface::vertex_t> no_vweight_map_t;
38
39
typedef eprop_map_t<int32_t>::type ::unchecked_t ecount_map_t;
typedef vprop_map_t<int32_t>::type ::unchecked_t vcount_map_t;
40

41
42
struct get_community_network_vertices_dispatch
{
43
    template <class Graph, class CommunityGraph, class CommunityMap,
44
              class VertexWeightMap>
45
46
    void operator()(const Graph& g, CommunityGraph& cg,
                    CommunityMap s_map, boost::any acs_map,
47
                    VertexWeightMap vweight, boost::any vcount) const
48
    {
49
        typename CommunityMap::checked_t cs_map = boost::any_cast<typename CommunityMap::checked_t>(acs_map);
50

Tiago Peixoto's avatar
Tiago Peixoto committed
51
52
        typedef typename boost::mpl::if_<std::is_same<no_vweight_map_t, VertexWeightMap>,
                                         vcount_map_t, VertexWeightMap>::type vweight_t;
53
        typename vweight_t::checked_t vertex_count = boost::any_cast<typename vweight_t::checked_t>(vcount);
54

55
        get_community_network_vertices()(g, cg, s_map, cs_map, vweight, vertex_count);
56
57
    }

58
59
60
61
62
63
64
65
66
67
68
69
};

struct get_community_network_edges_dispatch
{
    get_community_network_edges_dispatch(bool self_loops): _self_loops(self_loops) {}
    bool _self_loops;

    template <class Graph, class CommunityGraph, class CommunityMap,
              class EdgeWeightMap, class EdgeIndex>
    void operator()(const Graph& g, CommunityGraph& cg, EdgeIndex cedge_index,
                    CommunityMap s_map, boost::any acs_map,
                    EdgeWeightMap eweight, boost::any ecount) const
70
    {
71
72
        typename CommunityMap::checked_t cs_map = boost::any_cast<typename CommunityMap::checked_t>(acs_map);

Tiago Peixoto's avatar
Tiago Peixoto committed
73
74
        typedef typename boost::mpl::if_<std::is_same<no_eweight_map_t, EdgeWeightMap>,
                                         ecount_map_t, EdgeWeightMap>::type eweight_t;
75

76
77
78
79
80
        typename eweight_t::checked_t edge_count = boost::any_cast<typename eweight_t::checked_t>(ecount);
        get_community_network_edges()(g, cg, cedge_index, s_map,
                                      cs_map, eweight, edge_count,
                                      _self_loops);
    }
81
82
};

83
84
85
86
void community_network_edges(GraphInterface& gi, GraphInterface& cgi,
                             boost::any community_property,
                             boost::any condensed_community_property,
                             boost::any edge_count, boost::any eweight,
87
                             bool self_loops, bool parallel_edges);
88
89

void community_network(GraphInterface& gi, GraphInterface& cgi,
90
91
                       boost::any community_property,
                       boost::any condensed_community_property,
92
93
94
                       boost::any vertex_count, boost::any edge_count,
                       boost::any vweight, boost::any eweight, bool self_loops,
                       bool parallel_edges)
95
{
Tiago Peixoto's avatar
Tiago Peixoto committed
96
    typedef boost::mpl::push_back<writable_vertex_scalar_properties, no_vweight_map_t>::type
97
        vweight_properties;
98

99
    if (vweight.empty())
100
        vweight = no_vweight_map_t();
101

102
    run_action<>()
Tiago Peixoto's avatar
Tiago Peixoto committed
103
        (gi, std::bind(get_community_network_vertices_dispatch(),
104
105
106
                       std::placeholders::_1, std::ref(cgi.get_graph()),
                       std::placeholders::_2, condensed_community_property,
                       std::placeholders::_3, vertex_count),
107
108
109
         writable_vertex_properties(), vweight_properties())
        (community_property, vweight);

110
111
    community_network_edges(gi, cgi, community_property,
                            condensed_community_property, edge_count,
112
                            eweight, self_loops, parallel_edges);
113
}