File: delete_arcs.cat

package info (click to toggle)
scilab 2.4-1
  • links: PTS
  • area: non-free
  • in suites: potato, slink
  • size: 55,196 kB
  • ctags: 38,019
  • sloc: ansic: 231,970; fortran: 148,976; tcl: 7,099; makefile: 4,585; sh: 2,978; csh: 154; cpp: 101; asm: 39; sed: 5
file content (41 lines) | stat: -rw-r--r-- 1,257 bytes parent folder | download
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

delete_arcs(1)                 Scilab function                 delete_arcs(1)
NAME
  delete_arcs - deletes all the arcs or edges between a set of nodes

CALLING SEQUENCE
  g1 = delete_arcs(ij,g)

PARAMETERS

  ij : matrix of integers (number of nodes)

  g : graph list

  g1 : graph list of the new graph without the arcs or edges defined by ij

DESCRIPTION
  If g is a directed graph, delete_arcs returns the graph g1 with the arcs
  defined by matrix ij being deleted.  ij must be a n x 2 matrix of node
  numbers: the n arcs to be deleted are defined by couples of nodes (ij(i,1),
  ij(i,2)).

  If g is an undirected graph, the edges corresponding to matrix ij are
  deleted.

EXAMPLE
  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');

SEE ALSO
  add_edge, add_node, delete_nodes