<< Edges - Arcs Edges - Arcs add_edge_data >>
metanet >> metanet > Edges - Arcs > add_edge

add_edge

adds an edge or an arc between two nodes

Calling Sequence

g1 = add_edge(i,j,g)
g1 = add_edge(ij,g)

Parameters

i

vector of integers, number of start nodes

j

vector of integers, number of end nodes

ij

2 by n matrix of integers, first row contains the start node numbers, second row contains the end node numbers.

g

:a graph list (see graph_data_structure).

g1

graph list of the new graph with the added edges

Description

add_edge(i,j,g) returns the graph g1 with a new edges connecting node number i(k) to node number j(k). If the graph is directed, the edge is an arc. The number of edges plus 1 is taken as the name of the new edge.

add_edge(ij,g) returns the graph g1 with a new edges connecting node number ij(1,k) to node number ij(2,k). If the graph is directed, the edge is an arc. The number of edges plus 1 is taken as the name of the new edge.

Examples

ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 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 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]/2;
g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301]/2;
g.nodes.graphics.display='number';
show_graph(g);
ne=edge_number(g);
g=add_edge([1 1 9;7 16 9],g);
show_graph(g);
hilite_edges(ne+1:ne+3)

See Also


Report an issue
<< Edges - Arcs Edges - Arcs add_edge_data >>