graph_pagerank.hh 3.83 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) 2007-2012 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 23 24 25 26 27 28 29 30 31
//
// 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_PAGERANK_HH
#define GRAPH_PAGERANK_HH

#include "graph.hh"
#include "graph_filtering.hh"
#include "graph_util.hh"

namespace graph_tool
{
using namespace std;
using namespace boost;

struct get_pagerank
{
32 33
    template <class Graph, class VertexIndex, class RankMap, class PerMap,
              class Weight>
34
    void operator()(Graph& g, VertexIndex vertex_index, RankMap rank,
35 36
                    PerMap pers, Weight weight, double damping, double epsilon,
                    size_t max_iter, size_t& iter) const
Tiago Peixoto's avatar
Tiago Peixoto committed
37 38 39
    {
        typedef typename property_traits<RankMap>::value_type rank_type;

40 41
        RankMap r_temp(vertex_index, num_vertices(g));
        RankMap deg(vertex_index, num_vertices(g));
Tiago Peixoto's avatar
Tiago Peixoto committed
42 43 44 45 46 47 48 49 50 51

        // init ranks
        int i, N = num_vertices(g);
        #pragma omp parallel for default(shared) private(i)     \
                schedule(dynamic)
        for (i = 0; i < N; ++i)
        {
            typename graph_traits<Graph>::vertex_descriptor v = vertex(i, g);
            if (v == graph_traits<Graph>::null_vertex())
                continue;
52 53 54 55 56 57
            put(rank, v, get(pers, v));

            typename graph_traits<Graph>::out_edge_iterator e, e_end;
            put(deg, v, 0);
            for (tie(e, e_end) = out_edges(v, g); e!= e_end; ++e)
                put(deg, v, get(deg, v) + get(weight, *e));
Tiago Peixoto's avatar
Tiago Peixoto committed
58 59
        }

60
        rank_type delta = epsilon + 1;
Tiago Peixoto's avatar
Tiago Peixoto committed
61 62
        rank_type d = damping;
        iter = 0;
63
        while (delta >= epsilon)
Tiago Peixoto's avatar
Tiago Peixoto committed
64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82
        {
            delta = 0;
            int i, N = num_vertices(g);
            #pragma omp parallel for default(shared) private(i)     \
                schedule(dynamic) reduction(+:delta)
            for (i = 0; i < N; ++i)
            {
                typename graph_traits<Graph>::vertex_descriptor v =
                    vertex(i, g);
                if (v == graph_traits<Graph>::null_vertex())
                    continue;

                rank_type r = 0;
                typename in_edge_iteratorS<Graph>::type e, e_end;
                for (tie(e, e_end) = in_edge_iteratorS<Graph>::get_edges(v, g);
                     e != e_end; ++e)
                {
                    typename graph_traits<Graph>::vertex_descriptor s =
                        source(*e, g);
83
                    r += (get(rank, s) * get(weight, *e)) / get(deg, s);
Tiago Peixoto's avatar
Tiago Peixoto committed
84 85
                }

86 87 88
                put(r_temp, v, (1.0 - d) * get(pers, v) + d * r);

                delta += abs(get(r_temp, v) - get(rank, v));
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 109 110 111 112 113
            }
            swap(r_temp, rank);
            ++iter;
            if (max_iter > 0 && iter == max_iter)
                break;
        }

        if (iter % 2 != 0)
        {
            #pragma omp parallel for default(shared) private(i)     \
                schedule(dynamic)
            for (int i = 0; i < N; ++i)
            {
                typename graph_traits<Graph>::vertex_descriptor v =
                    vertex(i, g);
                if (v == graph_traits<Graph>::null_vertex())
                    continue;
                put(rank, v, get(r_temp, v));
            }
        }
    }
};

}
#endif // GRAPH_PAGERANK_HH