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
|
.TH delete_arcs 1 "September 1996" "Scilab Group" "Scilab function"
.so ../sci.an
.SH NAME
delete_arcs - deletes all the arcs or edges between a set of nodes
.SH CALLING SEQUENCE
.nf
g1 = delete_arcs(ij,g)
.fi
.SH PARAMETERS
.TP 3
ij
: matrix of integers (number of nodes)
.TP 2
g
: graph list
.TP 3
g1
: graph list of the new graph without the arcs or edges defined by ij
.SH DESCRIPTION
If \fVg\fR is a directed graph,
\fVdelete_arcs\fR returns the graph \fVg1\fR with the arcs defined
by matrix \fVij\fR being deleted.
\fVij\fR must be a n x 2 matrix of node numbers: the n arcs to be
deleted are defined by couples of nodes (\fVij(i,1)\fR, \fVij(i,2)\fR).
If \fVg\fR is an undirected graph, the edges corresponding to matrix \fVij\fR
are deleted.
.SH EXAMPLE
.nf
ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 10 10 11 12 13 13 13 14 15 16 16 17 17];
he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 13 13 15 12 13 9 10 14 11 16 1 17 14 15];
g=make_graph('foo',1,17,ta,he);
g('node_x')=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
g('node_y')=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
show_graph(g);
ij=[13 10;8 6;5 4;4 2];
gt=delete_arcs(ij,g);
show_graph(gt,'new');
g('directed')=0;
gt=delete_arcs(ij,g);
show_graph(gt,'new');
.fi
.SH SEE ALSO
add_edge, add_node, delete_nodes
|
