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
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
108
109
110
111
112
113
114
115
116
117
118
|
/**
*
* 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.
*
*/
double getNodeMin(tlp::Graph *subgraph=0);
%Docstring
tlp.DoubleProperty.getNodeMin([subgraph = None])
Returns the minimum value on the nodes for that double property.
:param subgraph: a sub-graph can be given in parameter, in that case return the minimum value on the nodes belonging to that sub-graph.
:type subgraph: :class:`tlp.Graph`
:rtype: float
%End
//===========================================================================================
double getNodeMax(tlp::Graph *subgraph=0);
%Docstring
tlp.DoubleProperty.getNodeMax([subgraph = None])
Returns the maximum value on the nodes for that double property.
:param subgraph: a sub-graph can be given in parameter, in that case return the maximum value on the nodes belonging to that sub-graph.
:type subgraph: :class:`tlp.Graph`
:rtype: float
%End
//===========================================================================================
double getEdgeMin(tlp::Graph *subgraph=0);
%Docstring
tlp.DoubleProperty.getEdgeMin([subgraph = None])
Returns the minimum value on the edges for that double property.
:param subgraph: a sub-graph can be given in parameter, in that case return the minimum value on the edges belonging to that sub-graph.
:type subgraph: :class:`tlp.Graph`
:rtype: float
%End
//===========================================================================================
double getEdgeMax(tlp::Graph *subgraph=0);
%Docstring
tlp.DoubleProperty.getEdgeMax([subgraph = None])
Returns the maximum value on the edges for that double property.
:param subgraph: a sub-graph can be given in parameter, in that case return the maximum value on the edges belonging to that sub-graph.
:type subgraph: :class:`tlp.Graph`
:rtype: float
%End
//===========================================================================================
void uniformQuantification(unsigned int n);
%Docstring
tlp.DoubleProperty.uniformQuantification(n)
Performs an uniform quantification on nodes and edges based on the values stored in that double property.
An uniform quantification tries to separate the nodes and edges in n classes of equivalent size according to theirs values in increasing order.
:param n: the number of desired classes
:type n: integer
.. warning:: All previous values on nodes and edges will be erased and replaced by the id of the class they belong to.
%End
//===========================================================================================
void nodesUniformQuantification(unsigned int n);
%Docstring
tlp.DoubleProperty.nodesUniformQuantification(n)
Performs an uniform quantification on nodes based on the values stored in that double property.
An uniform quantification tries to separate the nodes in n classes of equivalent size according to theirs values in increasing order.
:param n: the number of desired classes
:type n: integer
.. warning:: All previous values on nodes will be erased and replaced by the id of the class they belong to.
%End
//===========================================================================================
void edgesUniformQuantification(unsigned int n);
%Docstring
tlp.DoubleProperty.edgesUniformQuantification(n)
Performs an uniform quantification on edges based on the values stored in that double property.
An uniform quantification tries to separate the edges in n classes of equivalent size according to theirs values in increasing order.
:param n: the number of desired classes
:type n: integer
.. warning:: All previous values on edges will be erased and replaced by the id of the class they belong to.
%End
private:
void treatEvent(const tlp::Event&);
|
