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.
*
*/
void reverse();
%Docstring
tlp.BooleanProperty.reverse()
Reverses all values associated to graph elements,
i.e :const:`True` => :const:`False`, :const:`False` => :const:`True` .
%End
//===========================================================================================
void reverseEdgeDirection();
%Docstring
tlp.BooleanProperty.reverseEdgeDirection()
Reverses all the direction of edges in the attached graph
which are set to :const:`True` in this boolean property.
%End
//===========================================================================================
tlp::Iterator<tlp::node> *getNodesEqualTo(const bool val, tlp::Graph *graph = 0);
%Docstring
tlp.BooleanProperty.getNodesEqualTo(val[, graph = None])
Returns an iterator through all nodes belonging to the attached graph
whose associated value is equal to the one given in parameter.
:param val: a value
:type val: boolean
:param graph: a sub-graph can be given in parameter, in that case returns an iterator on nodes only belonging to that sub-graph
:type graph: :class:`tlp.Graph`
:rtype: :class:`tlp.IteratorNode`
%End
//===========================================================================================
tlp::Iterator<tlp::edge> *getEdgesEqualTo(const bool val, tlp::Graph *graph = 0);
%Docstring
tlp.BooleanProperty.getEdgesEqualTo(val[, graph = None])
Returns an iterator through all edges belonging to the attached graph
whose associated value is equal to the one given in parameter.
:param val: a value
:type val: boolean
:param graph: a sub-graph can be given in parameter, in that case returns an iterator on edges only belonging to that sub-graph
:type graph: :class:`tlp.Graph`
:rtype: :class:`tlp.IteratorEdge`
%End
|
