1
2
3
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip 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.
*
* Tulip 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.
*
*/
// +-------------------------------------------------------------------------+
// | Tulip Python Bindings |
// | inspired from bindings by the Booggie project development team |
// | (http://booggie.org/) |
// +-------------------------------------------------------------------------+
%ModuleHeaderCode
#include <tulip/MapIterator.h>
namespace tlp {
typedef tlp::Iterator<tlp::node> IteratorNode;
typedef tlp::Iterator<tlp::edge> IteratorEdge;
};
%End
%Include Iterator.sip
namespace tlp {
typedef tlp::Iterator<tlp::node> IteratorNode;
typedef tlp::Iterator<tlp::edge> IteratorEdge;
tlp::edge nextFaceEdge(tlp::Graph* g, tlp::edge source, tlp::node target);
class NodeMapIterator : tlp::IteratorNode {
%TypeHeaderCode
#include <tulip/MapIterator.h>
%End
public :
NodeMapIterator(tlp::Graph *sg, tlp::node source, tlp::node target);
~NodeMapIterator();
};
class EdgeMapIterator : tlp::IteratorEdge {
%TypeHeaderCode
#include <tulip/MapIterator.h>
%End
public :
EdgeMapIterator(tlp::Graph *sg, tlp::edge source, tlp::node target);
~EdgeMapIterator();
};
};
|
