edge_number — number of edges of a graph
ma = edge_number(g)
edge_number returns the number m of edges of the graph.
If the graph is directed, it is the number of arcs.
It is always equal to the dimension of g.edges.tail and g.edges.head.
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.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
g.nodes.graphics.display='number';
show_graph(g);
edge_number(g)
arc_number(g)
size(ta,2)
g.directed=0;
edge_number(g)
arc_number(g)