Important: The networks package has been deprecated.  Use the superseding package GraphTheory instead.

This procedure connects each vertex in S1 to a vertex in S2 with an edge. The names of the new edges are returned in an expression sequence.

If the 'directed' flag is included as an argument then all the edges are regarded as directed from S1 to S2. In all other cases, the edges are regarded as undirected.

Specific edge weights and names can be indicated by providing a list of weights (L1) and names (L1). In the case of more than one edge, it can be helpful to provide the vertices as lists rather than sets so that mapping to the edges is unaffected by the random ordering of elements in sets.

The lists L1 and L2 must contain $\mathrm{c1}\mathrm{c2}$ entries where S1 and S2 contain c1 and c2 elements respectively.

This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[connect](...).

$\mathrm{with}\left(\mathrm{networks}\right)\:$

$G≔\mathrm{void}\left(9\right)\:$

$\mathrm{connect}\left(\left\{1\,2\right\}\,\left\{3\,4\right\}\,G\right)$

$\mathrm{e1},\mathrm{e2},\mathrm{e3},\mathrm{e4}$

$\mathrm{connect}\left(\left\{4\right\}\,\left[5\,6\,7\right]\,\mathrm{names}=\left[\mathrm{ee1}\,\mathrm{ee2}\,\mathrm{ee3}\right]\,'\mathrm{directed}'\,G\right)$

$\mathrm{ee1},\mathrm{ee2},\mathrm{ee3}$