[79637f]: devel / graphs / drawEdgeLabels.m  Maximize  Restore  History

Download this file

82 lines (72 with data), 3.0 kB

 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
## Copyright (C) 2004-2011 David Legland <david.legland@grignon.inra.fr>
## Copyright (C) 2004-2011 INRA - CEPIA Nantes - MIAJ (Jouy-en-Josas)
## Copyright (C) 2012 Adapted to Octave by Juan Pablo Carbajal <carbajal@ifi.uzh.ch>
## All rights reserved.
##
## Redistribution and use in source and binary forms, with or without
## modification, are permitted provided that the following conditions are met:
##
## 1 Redistributions of source code must retain the above copyright notice,
## this list of conditions and the following disclaimer.
## 2 Redistributions in binary form must reproduce the above copyright
## notice, this list of conditions and the following disclaimer in the
## documentation and/or other materials provided with the distribution.
##
## THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
## AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
## IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
## ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
## ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
## DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
## SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
## CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
## OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
## OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
function varargout = drawEdgeLabels(p, e, value)
#DRAWEDGELABELS Draw values associated to graph edges
#
# usage:
# drawEdgeLabels(NODES, EDGES, VALUES);
# NODES: array of double, containing x and y values of nodes
# EDGES: array of int, containing indices of in and out nodes
# VALUES is an array the same length of EDGES, containing values
# associated to each edges of the graph.
#
# The function computes the center of each edge, and puts the text with
# associated value.
#
# H = drawEdgeLabels(...) return array of handles to each text structure,
# making possible to change font, color, size
#
#
# -----
# author: David Legland
# INRA - TPV URPOI - BIA IMASTE
# created the 10/02/2003.
#
# HISTORY
# 10/03/2004 included into lib/graph library
if length(p) > 1 && length(e) > 1
h = zeros(length(e), 1);
hold on;
for l=1:length(e)
# indices of source and target nodes
n1 = e(l, 1);
n2 = e(l, 2);
# node coordinates
x1 = p(n1, 1);
y1 = p(n1, 2);
x2 = p(n2, 1);
y2 = p(n2, 2);
# display the edge
line([x1 x2], [y1 y2]);
# coordinates of edge label
xm = (x1 + x2)/2;
ym = (y1 + y2)/2;
# display label
h(l) = text(xm, ym, sprintf('%3d', floor(value(l))));
end
end
if nargout == 1
varargout = {h};
end

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

JavaScript is required for this form.





No, thanks