graph_python_interface.hh 15.3 KB
Newer Older
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>
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
// along with this program. If not, see <http://www.gnu.org/licenses/>.
17

18
19
#ifndef PYTHON_INTERFACE_HH
#define PYTHON_INTERFACE_HH
20

21
22
23
24
25
26
27
28
29
#include <boost/python.hpp>
#include <boost/python/type_id.hpp>

namespace boost
{
    size_t hash_value(const boost::python::object& o);
}


30
31
#include <boost/graph/graph_traits.hpp>
#include <boost/mpl/logical.hpp>
32
#include <boost/functional/hash.hpp>
33
#include <boost/iterator/iterator_facade.hpp>
34

35
36
#include "graph.hh"
#include "graph_filtering.hh"
37
#include "graph_selectors.hh"
38
#include "numpy_bind.hh"
39

40

41
// this file includes a simple python interface for the internally kept
42
43
44
45
// graph. It defines a PythonVertex, PythonEdge and PythonIterator template
// classes, which contain the proper member functions for graph traversal. These
// types are then specialized for each version of the adapted graph (directed,
// undirected, filtered, reversed).
46

47
48
49
50
namespace graph_tool
{
using namespace boost;

51
52
// generic iterator adaptor which can be used to iterate vertices, edges,
// out_edges and in_edges through python
53
template <class Descriptor, class Iterator>
54
class PythonIterator
55
{
56
public:
57
58
    PythonIterator(const python::object& g, std::pair<Iterator,Iterator> e)
        : _g(g), _e(e) {}
59
    Descriptor Next()
60
    {
61
62
        if (_e.first == _e.second)
            python::objects::stop_iteration_error();
63
64
65
66
        if (_g() == python::object())
            throw GraphException("The corresponding graph object has been"
                                 " deleted during iteration!");
        Descriptor e(_g, *_e.first);
67
68
        ++_e.first;
        return e;
69
70
    }
private:
71
    python::object _g;
72
    std::pair<Iterator,Iterator> _e;
Tiago Peixoto's avatar
Tiago Peixoto committed
73
74
75
};


76
// forward declaration of PythonEdge
77
78
template <class Graph>
class PythonEdge;
79

80
// below are classes related to the PythonVertex type
81
class PythonVertex
82
83
{
public:
84
85
    PythonVertex(const python::object& g, GraphInterface::vertex_t v):
        _g(g), _v(v), _valid(true)
86
87
88
89
90
91
    {
        CheckValid();
    }

    bool IsValid() const
    {
92
93
        if (_g().ptr() == Py_None)
            return false;
94
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
95
96
        return _valid &&
            (_v != graph_traits<GraphInterface::multigraph_t>::null_vertex()) &&
Tiago Peixoto's avatar
Tiago Peixoto committed
97
            (_v < num_vertices(gi._state->_mg));
98
    }
99

100
    void SetValid(bool valid)
101
    {
102
103
        _valid = valid;
    }
104

105
106
107
    void CheckValid() const
    {
        if (!IsValid())
108
109
            throw ValueException("invalid vertex descriptor: " +
                                 lexical_cast<string>(_v));
110
    }
111

112
113
114
115
116
    python::object GetGraph() const
    {
        return _g();
    }

117
    GraphInterface::vertex_t GetDescriptor() const
118
119
120
121
    {
        return _v;
    }

122
123
124
125
    template <class DegSelector>
    struct get_degree
    {
        template<class Graph>
126
        void operator()(const Graph& g,
127
128
129
                        typename graph_traits<Graph>::vertex_descriptor v,
                        size_t& deg) const
        {
130
            deg = DegSelector()(v, g);
131
132
133
        }
    };

134
    size_t GetInDegree() const
135
    {
136
        CheckValid();
137
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
138
        size_t in_deg;
139
140
141
        run_action<>()(gi, bind<void>(get_degree<in_degreeS>(),
                                      _1, _v,
                                      ref(in_deg)))();
142
        return in_deg;
143
    }
144

145
    size_t GetOutDegree() const
146
    {
147
        CheckValid();
148
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
149
        size_t out_deg;
150
151
        run_action<>()(gi, bind<void>(get_degree<out_degreeS>(), _1, _v,
                                      ref(out_deg)))();
152
        return out_deg;
Tiago Peixoto's avatar
Tiago Peixoto committed
153
154
    }

155
    // provide iterator support for out_edges
156

157
158
159
    struct get_out_edges
    {
        template<class Graph>
160
        void operator()(const Graph& g, const python::object& pg,
161
162
163
164
165
166
167
                        typename graph_traits<Graph>::vertex_descriptor v,
                        python::object& iter) const
        {
            typedef typename graph_traits<Graph>::out_edge_iterator
                out_edge_iterator;
            iter = python::object(PythonIterator<PythonEdge<Graph>,
                                                 out_edge_iterator>
168
                                  (pg, out_edges(v, g)));
169
170
171
172
        }
    };

    python::object
173
    OutEdges() const
Tiago Peixoto's avatar
Tiago Peixoto committed
174
    {
175
        CheckValid();
176
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
177
        python::object iter;
178
179
        run_action<>()(gi, bind<void>(get_out_edges(), _1,
                                      ref(_g), _v, ref(iter)))();
180
        return iter;
181
    }
182

183
184
185
    struct get_in_edges
    {
        template<class Graph>
186
        void operator()(const Graph& g, const python::object& pg,
187
188
189
190
191
192
193
                        typename graph_traits<Graph>::vertex_descriptor v,
                        python::object& iter) const
        {
            typedef typename in_edge_iteratorS<Graph>::type
                in_edge_iterator;
            iter = python::object
                (PythonIterator<PythonEdge<Graph>,in_edge_iterator>
194
                 (pg, in_edge_iteratorS<Graph>::get_edges(v, g)));
195
196
197
198
        }
    };

    python::object
199
    InEdges() const
200
    {
201
        CheckValid();
202
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
203
        python::object iter;
204
205
        run_action<>()(gi, bind<void>(get_in_edges(), _1, ref(_g), _v,
                                      ref(iter)))();
206
        return iter;
Tiago Peixoto's avatar
Tiago Peixoto committed
207
    }
208

209
210
    std::string GetString() const
    {
211
        CheckValid();
212
213
214
        return lexical_cast<std::string>(_v);
    }

215
    size_t GetHash() const
216
    {
217
        return hash<size_t>()(_v);
218
219
    }

220
221
    size_t GetIndex() const
    {
222
        CheckValid();
223
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
224
        return gi._vertex_index[_v];
225
226
    }

227
    bool operator==(const PythonVertex& other) const
228
    {
229
230
        CheckValid();
        other.CheckValid();
231
        return other._v == _v;
232
    }
233

234
    bool operator!=(const PythonVertex& other) const
235
    {
236
237
        CheckValid();
        other.CheckValid();
238
        return other._v != _v;
239
240
    }

241
private:
242
    python::object _g;
243
    GraphInterface::vertex_t _v;
244
    bool _valid;
245
};
246

247
// below are classes related to the PythonEdge type
248

249
250
class EdgeBase {}; // useful to unite all edge types

251
template <class Graph>
252
class PythonEdge : public EdgeBase
253
254
{
public:
Tiago Peixoto's avatar
Tiago Peixoto committed
255
    typedef typename graph_traits<Graph>::edge_descriptor edge_descriptor;
256
257
    PythonEdge(const python::object& g, edge_descriptor e)
        : _g(g), _e(e), _valid(true)
258
259
260
261
262
    {
        CheckValid();
    }

    bool IsValid() const
Tiago Peixoto's avatar
Tiago Peixoto committed
263
    {
264
        if (_g().ptr() == Py_None || !_valid)
265
            return false;
266
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
267
        GraphInterface::edge_t e(_e);
268
269
        bool valid = PythonVertex(_g, source(e, gi._state->_mg)).IsValid() &&
            PythonVertex(_g, target(e, gi._state->_mg)).IsValid();
270
271
272

        if (valid)
            valid = gi.GetEdgeIndex()[e] <= gi.GetMaxEdgeIndex();
273
        return valid;
274
275
276
277
278
279
280
281
282
    }

    void SetValid(bool valid)
    {
        _valid = valid;
    }

    void CheckValid() const
    {
283
        if (!IsValid())
Tiago Peixoto's avatar
Tiago Peixoto committed
284
            throw ValueException("invalid edge descriptor");
Tiago Peixoto's avatar
Tiago Peixoto committed
285
286
    }

287
288
289
290
291
    python::object GetGraph() const
    {
        return _g();
    }

292
    GraphInterface::edge_t GetDescriptor() const
293
294
295
296
    {
        return _e;
    }

297
298
299
    struct get_source
    {
        template<class GraphType>
300
        void operator()(const GraphType& g, const python::object& pg,
301
302
303
                        const edge_descriptor& edge, python::object& vertex)
            const
        {
304
305
            typedef typename graph_traits<GraphType>::edge_descriptor edge_t;
            vertex = python::object(PythonVertex(pg, source(edge_t(edge), g)));
306
307
        }
    };
308

309
    python::object GetSource() const
Tiago Peixoto's avatar
Tiago Peixoto committed
310
    {
311
        CheckValid();
312
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
313
        python::object v;
314
315
        run_action<>()(gi, bind<void>(get_source(), _1, ref(_g), ref(_e),
                                      ref(v)))();
316
        return v;
Tiago Peixoto's avatar
Tiago Peixoto committed
317
318
    }

319
320
321
    struct get_target
    {
        template<class GraphType>
322
323
324
        void operator()(const GraphType& g, const python::object& pg,
                        const edge_descriptor& edge, python::object& vertex)
            const
325
        {
326
327
            typedef typename graph_traits<GraphType>::edge_descriptor edge_t;
            vertex = python::object(PythonVertex(pg, target(edge_t(edge), g)));
328
329
        }
    };
330

331
    python::object GetTarget() const
Tiago Peixoto's avatar
Tiago Peixoto committed
332
    {
333
        CheckValid();
334
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
335
        python::object v;
336
337
        run_action<>()(gi, bind<void>(get_target(), _1, ref(_g), ref(_e),
                                      ref(v)))();
338
        return v;
Tiago Peixoto's avatar
Tiago Peixoto committed
339
340
    }

341
342
    std::string GetString() const
    {
343
344
        PythonVertex src = python::extract<PythonVertex>(GetSource());
        PythonVertex tgt = python::extract<PythonVertex>(GetTarget());
345
        return "(" + src.GetString() + ", " + tgt.GetString() + ")";
346
347
    }

348
    size_t GetHash() const
Tiago Peixoto's avatar
Tiago Peixoto committed
349
    {
350
        CheckValid();
351
        GraphInterface& gi = python::extract<GraphInterface&>(_g().attr("_Graph__graph"));
352
        return hash<size_t>()(gi._edge_index[_e]);
Tiago Peixoto's avatar
Tiago Peixoto committed
353
354
    }

355
    bool operator==(const PythonEdge& other) const
Tiago Peixoto's avatar
Tiago Peixoto committed
356
    {
357
        CheckValid();
358
        other.CheckValid();
359
        return other._e == _e;
Tiago Peixoto's avatar
Tiago Peixoto committed
360
    }
361

362
    bool operator!=(const PythonEdge& other) const
363
    {
364
        CheckValid();
365
        other.CheckValid();
366
        return other._e != _e;
367
368
369
    }

private:
370
    python::object _g;
371
    edge_descriptor _e;
372
    bool _valid;
373
374
};

375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
// metafunction to determine wether or not to return copies or internal
// references to property types
struct return_reference
{
    template <class ValueType>
    struct apply
    {
        // return actual references only for non-string and non-python::object
        // classes

        typedef typename mpl::if_<
            typename mpl::and_<
                is_class<ValueType>,
                typename mpl::and_<
                    typename mpl::not_<is_same<ValueType,
                                               string> >::type,
                    typename mpl::not_<is_same<ValueType,
                                               python::object> >::type>::type
                >::type,
            mpl::bool_<true>,
            mpl::bool_<false> >::type type;
    };
};

template <class PropertyMap>
400
401
402
class PythonPropertyMap
{
public:
403
404
    PythonPropertyMap(const PropertyMap& pmap)
        : _pmap(pmap) {}
405

406
407
408
409
410
411
412
    typedef typename property_traits<PropertyMap>::value_type value_type;

    typedef typename mpl::if_<
        typename return_reference::apply<value_type>::type,
        value_type&,
        value_type>::type reference;

413
    template <class PythonDescriptor>
414
    reference GetValue(const PythonDescriptor& key)
415
    {
416
        key.CheckValid();
417
        return get(_pmap, key.GetDescriptor());
418
419
    }

420
421
    // in this case, val should be a copy, not a reference. This is to avoid a
    // problem with vector-valued property maps
422
    template <class PythonDescriptor>
423
    void SetValue(const PythonDescriptor& key, value_type val)
424
    {
425
426
427
428
        set_value(key, val,
                  is_convertible<
                  typename property_traits<PropertyMap>::category,
                  writable_property_map_tag>());
429
430
    }

431
432
433
    template <class PythonDescriptor>
    void set_value(const PythonDescriptor& key, const value_type& val,
                   true_type)
434
    {
435
436
        key.CheckValid();
        put(_pmap, key.GetDescriptor(), val);
437
438
    }

439
    template <class PythonDescriptor>
440
441
    void set_value(const PythonDescriptor& key, const value_type& val,
                   false_type)
442
    {
Tiago Peixoto's avatar
Tiago Peixoto committed
443
        throw ValueException("property is read-only");
444
445
446
447
    }

    size_t GetHash() const
    {
448
        return hash<size_t>()(size_t(this));
449
450
451
452
    }

    std::string GetType() const
    {
453
454
455
456
457
458
459
        using python::detail::gcc_demangle;
        if (is_same<typename mpl::find<value_types,value_type>::type,
                    typename mpl::end<value_types>::type>::value)
            return gcc_demangle(typeid(value_type).name());
        else
            return type_names[mpl::find<value_types,
                                        value_type>::type::pos::value];
460
461
    }

462
    boost::any GetMap() const
463
464
465
466
    {
        return _pmap;
    }

467
468
469
470
471
472
473
    boost::any GetDynamicMap() const
    {
        return (dynamic_property_map*)
            (new boost::detail::dynamic_property_map_adaptor<PropertyMap>
             (_pmap));
    }

474
475
476
    python::object GetArray(size_t size)
    {
        typedef typename mpl::or_<
477
478
479
480
481
482
483
484
485
              typename mpl::or_<
                   is_same<PropertyMap,
                           GraphInterface::vertex_index_map_t>,
                   is_same<PropertyMap,
                           GraphInterface::edge_index_map_t> >::type,
              typename mpl::not_<
                  typename mpl::has_key<numpy_types, value_type>::type >
            ::type>::type isnt_vector_map;
        return get_array(_pmap, size, isnt_vector_map());
486
487
488
489
490
491
492
493
494
495
496
497
498
    }

    python::object get_array(PropertyMap pmap, size_t size, mpl::bool_<false>)
    {
        _pmap.reserve(size);
        return wrap_vector_not_owned(_pmap.get_storage());
    }

    python::object get_array(PropertyMap pmap, size_t size, mpl::bool_<true>)
    {
        return python::object();
    }

499
500
    bool IsWritable() const
    {
501
502
        return is_convertible<typename property_traits<PropertyMap>::category,
                              writable_property_map_tag>::value;
503
504
    }

505
private:
506
    PropertyMap _pmap; // hold an internal copy, since it's cheap
507
508
509
};


510
511
512
513
514
515
516
517
518
519
520
521
522
//
// Create new properties
//

struct new_property_map
{
    template <class ValueType, class IndexMap>
    void operator()(ValueType, IndexMap index, const string& type_name,
                    python::object& new_prop, bool& found) const
    {
        size_t i = mpl::find<value_types,ValueType>::type::pos::value;
        if (type_name == type_names[i])
        {
523
524
            typedef typename property_map_type::apply<ValueType, IndexMap>::type
                map_t;
525
526
527
528
529
530
531
532
            map_t prop(index);
            new_prop = python::object(PythonPropertyMap<map_t>(prop));
            found = true;
        }
    }
};

template <class IndexMap>
533
python::object new_property(const string& type, IndexMap index_map)
534
535
536
{
    python::object prop;
    bool found = false;
537
538
    mpl::for_each<value_types>(bind<void>(new_property_map(), _1, index_map,
                                          ref(type), ref(prop), ref(found)));
539
    if (!found)
Tiago Peixoto's avatar
Tiago Peixoto committed
540
        throw ValueException("Invalid property type: " + type);
541
542
543
    return prop;
}

544
545
546
} //graph_tool namespace

#endif