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
|
.TH subgraph 1 "September 1996" "Scilab Group" "Scilab function"
.so ../sci.an
.SH NAME
subgraph - subgraph of a graph
.SH CALLING SEQUENCE
.nf
g1 = subgraph(v,ind,g)
.fi
.SH PARAMETERS
.TP 2
v
: row vector, numbers of nodes or edges
.TP 4
ind
: string, 'nodes' or 'edges'
.TP 2
g
: graph list
.TP 3
g1
: graph list of the new graph
.SH DESCRIPTION
\fVsubgraph\fR returns the graph \fVg1\fR, built with the numbers given by the
the row vector \fVv\fR.
If \fVind\fR is the string \fV'nodes'\fR, \fVg1\fR is built with the node
numbers given by \fVv\fR and the connected edges of these nodes in \fVg\fR.
If \fVind\fR is the string \fV'edges'\fR, \fVg1\fR is built with the edge
numbers given by \fVv\fR and the tail-head nodes of these edges in \fVg\fR.
All the characteristics of the old nodes and edges of \fVg\fR are preserved.
.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];
g('edge_color')=modulo([1:(edge_number(g))],15)+1;
g('node_diam')=[1:(g('node_number'))]+20;
show_graph(g);
v=[2 3 4 5 17 13 10];
show_nodes(v);
g1=subgraph(v,'nodes',g);
show_graph(g1);
v=[10 13 12 16 20 19];
show_graph(g);
show_arcs(v);
g1=subgraph(v,'edges',g);
show_graph(g1);
.fi
.SH SEE ALSO
add_edge, add_node, delete_arcs, delete_nodes, supernode
|
