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
|
.TH arc_graph 1 "September 1996" "Scilab Group" "Scilab function"
.so ../sci.an
.SH NAME
arc_graph - graph with nodes corresponding to arcs
.SH CALLING SEQUENCE
.nf
g1 = arc_graph(g)
.fi
.SH PARAMETERS
.TP 2
g
: graph list of the old graph
.TP 3
g1
: graph list of the new graph
.SH DESCRIPTION
\fVarc_graph\fR returns the directed graph \fVg1\fR with the nodes
corresponding to the arcs of the directed graph \fVg\fR.
\fVg1\fR is defined in the following way:
- its nodes correspond to the arcs of \fVg\fR
- 2 nodes of the new graph are adjacent if and only if the corresponding
arcs of the graph \fVg\fR are consecutive.
The coordinates of the nodes of \fVg1\fR are given by the middle points of the
corresponding edges of \fVg\fR.
If such an arc graph does not exist, an empty vector is returned.
.SH EXAMPLE
.nf
ta=[1 1 2 4 4 5 6 7 2 3 5 1];
he=[2 6 3 6 7 8 8 8 4 7 3 5];
g=make_graph('foo',1,8,ta,he);
g('node_x')=[281 284 360 185 405 182 118 45];
g('node_y')=[262 179 130 154 368 248 64 309];
show_graph(g);
g1=arc_graph(g);
show_graph(g1,'new');
.fi
.SH SEE ALSO
line_graph
|
