graph_incidence.hh 2.04 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_INCIDENCE_HH
#define GRAPH_INCIDENCE_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_incidence
{
    template <class Graph, class VIndex, class EIndex>
    void operator()(Graph& g, VIndex vindex, EIndex eindex,
                    multi_array_ref<double,1>& data,
                    multi_array_ref<int32_t,1>& i,
                    multi_array_ref<int32_t,1>& j) const
    {
        int pos = 0;
38
        for (auto v : vertices_range(g))
39
        {
40
            for (const auto& e : out_edges_range(v, g))
41
            {
42
                if (graph_tool::is_directed(g))
43
44
45
                    data[pos] = -1;
                else
                    data[pos] = 1;
46
47
                i[pos] = get(vindex, v);
                j[pos] = get(eindex, e);
48
49
50
                ++pos;
            }

51
            if (graph_tool::is_directed(g))
52
            {
53
54
55
56
57
58
59
                for (const auto& e : in_edges_range(v, g))
                {
                    data[pos] = 1;
                    i[pos] = get(vindex, v);
                    j[pos] = get(eindex, e);
                    ++pos;
                }
60
61
62
63
64
65
66
67
            }
        }
    }
};

} // namespace graph_tool

#endif // GRAPH_INCIDENCE_HH