graph_distance.hh 5.36 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-2013 Tiago de Paula Peixoto <tiago@skewed.de>
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
//
// 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_DISTANCE_HH
#define GRAPH_DISTANCE_HH

#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/dijkstra_shortest_paths.hpp>

24
25
26
27
28
29
30
#include <boost/python/object.hpp>
#include <boost/python/list.hpp>
#include <boost/python/extract.hpp>

#include "histogram.hh"
#include "numpy_bind.hh"

31
32
33
34
35
36
37
38
39
namespace graph_tool
{
using namespace std;
using namespace boost;

// retrieves the vertex-vertex distance histogram

struct no_weightS {};

40
41
42
43
44
45
46
47
48
49
50
51
template <class Map>
struct get_val_type
{
    typedef typename property_traits<Map>::value_type type;
};

template <>
struct get_val_type<no_weightS>
{
    typedef size_t type;
};

52
53
54
struct get_distance_histogram
{

55
56
57
58
    template <class Graph, class VertexIndex, class WeightMap>
    void operator()(const Graph& g, VertexIndex vertex_index, WeightMap weights,
                    const vector<long double>& obins, python::object& phist)
        const
59
    {
60
61
62
63
        typedef typename graph_traits<Graph>::vertex_descriptor vertex_t;

        // select get_vertex_dists based on the existence of weights
        typedef typename mpl::if_<is_same<WeightMap, no_weightS>,
64
                                  get_dists_bfs,
65
66
                                  get_dists_djk>::type get_vertex_dists_t;

67
68
69
70
71
72
73
74
75
        // distance type
        typedef typename get_val_type<WeightMap>::type val_type;
        typedef Histogram<val_type, size_t, 1> hist_t;

        array<vector<val_type>,1> bins;
        bins[0].resize(obins.size());
        for (size_t i = 0; i < obins.size(); ++i)
            bins[0][i] = obins[i];

76
        hist_t hist(bins);
77
78
79
        SharedHistogram<hist_t> s_hist(hist);

        typename hist_t::point_t point;
80
81
        get_vertex_dists_t get_vertex_dists;
        int i, N = num_vertices(g);
82
83
        #pragma omp parallel for default(shared) private(i,point) \
            firstprivate(s_hist) schedule(dynamic)
84
85
86
87
88
        for (i = 0; i < N; ++i)
        {
            vertex_t v = vertex(i, g);
            if (v == graph_traits<Graph>::null_vertex())
                continue;
89
90
91
            unchecked_vector_property_map<val_type,VertexIndex>
                dist_map(vertex_index, num_vertices(g));

92
            for (size_t j = 0; j < size_t(N); ++j)
93
            {
94
                if (vertex(j,g) != graph_traits<Graph>::null_vertex())
95
96
                    dist_map[vertex(j,g)] =  numeric_limits<val_type>::max();
            }
97

98
99
            dist_map[v] = 0;
            get_vertex_dists(g, v, vertex_index, dist_map, weights);
100
101
102

            typename graph_traits<Graph>::vertex_iterator v2, v_end;
            for (tie(v2, v_end) = vertices(g); v2 != v_end; ++v2)
103
104
                if (*v2 != v &&
                    dist_map[*v2] != numeric_limits<val_type>::max())
105
                {
106
107
                    point[0] = dist_map[*v2];
                    s_hist.PutValue(point);
108
                }
109
        }
110
111
112
113
114
115
        s_hist.Gather();

        python::list ret;
        ret.append(wrap_multi_array_owned<size_t,1>(hist.GetArray()));
        ret.append(wrap_vector_owned<val_type>(hist.GetBins()[0]));
        phist = ret;
116
117
118
119
120
    }

    // weighted version. Use dijkstra_shortest_paths()
    struct get_dists_djk
    {
121
122
123
        template <class Graph, class Vertex, class VertexIndex,
                  class DistanceMap, class WeightMap>
        void operator()(const Graph& g, Vertex s, VertexIndex vertex_index,
124
125
                        DistanceMap dist_map, WeightMap weights) const
        {
126
            dijkstra_shortest_paths(g, s, vertex_index_map(vertex_index).
127
128
129
130
131
132
133
                                    weight_map(weights).distance_map(dist_map));
        }
    };

    // unweighted version. Use BFS.
    struct get_dists_bfs
    {
134
135
136
        template <class Graph, class Vertex, class VertexIndex,
                  class DistanceMap>
        void operator()(const Graph& g, Vertex s, VertexIndex vertex_index,
137
138
139
140
                        DistanceMap dist_map, no_weightS) const
        {
            typedef typename graph_traits<Graph>::vertex_descriptor vertex_t;
            typedef tr1::unordered_map<vertex_t,default_color_type,
141
142
                                       DescriptorHash<VertexIndex> > cmap_t;
            cmap_t cmap(0, DescriptorHash<VertexIndex>(vertex_index));
143
            InitializedPropertyMap<cmap_t>
144
                color_map(cmap, color_traits<default_color_type>::white());
145
146

            breadth_first_visit(g, s,
147
                                visitor(make_bfs_visitor
148
                                        (record_distances(dist_map,
149
                                                          on_tree_edge()))).
150
                                color_map(color_map));
151
152
153
154
155
156
157
        }
    };
};

} // boost namespace

#endif // GRAPH_DISTANCE_HH