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

An edge is said to be spanned by an edge set eset if both its ends are in the set of ends of edges in eset. This routine returns the set of edges spanned by eset in G.

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

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

$G≔\mathrm{complete}\left(5\right)\:$

$\mathrm{ends}\left(\left\{\mathrm{e1}\,\mathrm{e2}\,\mathrm{e7}\right\}\,G\right)$

$\left\{\left\{1\,2\right\}\,\left\{1\,3\right\}\,\left\{2\,5\right\}\right\}$

$\mathrm{span}\left(\left\{\mathrm{e1}\,\mathrm{e2}\,\mathrm{e7}\right\}\,G\right)$

$\left\{\mathrm{e1}\,\mathrm{e2}\,\mathrm{e4}\,\mathrm{e5}\,\mathrm{e7}\,\mathrm{e9}\right\}$

$\mathrm{ends}\left(\,G\right)$

$\left\{\left\{1\,2\right\}\,\left\{1\,3\right\}\,\left\{1\,5\right\}\,\left\{2\,3\right\}\,\left\{2\,5\right\}\,\left\{3\,5\right\}\right\}$