1
.TH split_edge 1 "September 1996" "Scilab Group" "Scilab function"
4
split_edge - splits an edge by inserting a node
7
g1 = split_edge(i,j,g,name)
12
: integer, number of start node of edge
15
: integer, number of end node of edge
21
: optional name of the added node
24
: graph list of the new graph
26
\fVsplit_edge\fR returns the graph \fVg1\fR, the edge from node
27
number \fVi\fR to node number \fVj\fR being splitted: a new node is created
28
and located at the middle point between the 2 previous nodes. This new node
29
is linked with the 2 nodes \fVi\fR and \fVj\fR.
30
If \fVname\fR is given, it is the name of the new node, otherwise the number
31
of nodes plus 1 is taken as the name of the new node.
34
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];
35
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];
36
g=make_graph('foo',1,17,ta,he);
37
g('node_x')=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
38
g('node_y')=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
44
add_edge, add_node, delete_arcs, delete_nodes