graph_adjacency.hh 3.44 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-2020 Tiago de Paula Peixoto <tiago@skewed.de>
4
//
5 6 7 8
// This program is free software; you can redistribute it and/or modify it under
// the terms of the GNU Lesser General Public License as published by the Free
// Software Foundation; either version 3 of the License, or (at your option) any
// later version.
9
//
10 11 12 13
// 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 Lesser General Public License for more
// details.
14
//
15
// You should have received a copy of the GNU Lesser General Public License
16 17 18 19 20 21 22 23 24 25 26
// along with this program. If not, see <http://www.gnu.org/licenses/>.

#ifndef GRAPH_ADJACENCY_MATRIX_HH
#define GRAPH_ADJACENCY_MATRIX_HH

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

namespace graph_tool
{
Tiago Peixoto's avatar
Tiago Peixoto committed
27
using namespace boost;
28 29 30 31 32 33 34 35 36 37

struct get_adjacency
{
    template <class Graph, class Index, class Weight>
    void operator()(Graph& g, Index index, Weight weight,
                    multi_array_ref<double,1>& data,
                    multi_array_ref<int,1>& i,
                    multi_array_ref<int,1>& j) const
    {
        int pos = 0;
38
        for (const auto& e : edges_range(g))
39
        {
40 41 42
            data[pos] = get(weight, e);
            i[pos] = get(index, target(e, g));
            j[pos] = get(index, source(e, g));
43 44

            ++pos;
45
            if (!graph_tool::is_directed(g))
46
            {
47 48 49
                data[pos] = get(weight, e);
                i[pos] = get(index, source(e, g));
                j[pos] = get(index, target(e, g));
50 51 52 53 54 55
                ++pos;
            }
        }
    }
};

56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
template <class Graph, class Vindex, class Weight, class V>
void adj_matvec(Graph& g, Vindex index, Weight w, V& x, V& ret)
{
    parallel_vertex_loop
        (g,
         [&](auto v)
         {
             size_t i = get(index, v);
             std::remove_reference_t<decltype(ret[i])> y = 0;
             if constexpr (!std::is_same_v<Weight, UnityPropertyMap<double, GraphInterface::edge_t>>)
             {
                 for (auto e : in_or_out_edges_range(v, g))
                     y += get(w, e) * x[get(index, target(e, g))];
             }
             else
             {
                 for (auto u : in_or_out_neighbors_range(v, g))
                     y += x[get(index, u)];
             }
             ret[i] = y;
         });
}

template <class Graph, class Vindex, class Weight, class M>
void adj_matmat(Graph& g, Vindex index, Weight w, M& x, M& ret)
{
    size_t k = x.shape()[1];
    parallel_vertex_loop
        (g,
         [&](auto v)
         {
             size_t i = get(index, v);
             auto y = ret[i];
             if constexpr (!std::is_same_v<Weight, UnityPropertyMap<double, GraphInterface::edge_t>>)
             {
                 for (auto e : in_or_out_edges_range(v, g))
                 {
                     auto w_e = get(w, e);
                     for (size_t l = 0; l < k; ++l)
                         y[l] += w_e * x[get(index, target(e, g))][l];
                 }
             }
             else
             {
                 for (auto u : in_or_out_neighbors_range(v, g))
                     for (size_t l = 0; l < k; ++l)
                         y[l] += x[get(index, u)][l];
             }

         });
}

108 109 110
} // namespace graph_tool

#endif // GRAPH_ADJACENCY_MATRIX_HH