Important:The networks package has been deprecated. Use the superseding command GraphTheory[IncidentEdges]instead.

Given a vertex v the edges incident with v are returned as a set.

Given a vertex set then the set of cut edges to the subgraph induced by that set of edges is returned.

The 'In'/'Out' flags specify which kind of directed edges should be considered.  Undirected edges are considered bidirectional and included in both classifications.

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

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

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

$\mathrm{addvertex}\left(4\,G\right)\:$

$\mathrm{addedge}\left(\left\{\mathrm{seq}\left(\left[4\,i\right]\,i=1..3\right)\right\}\,G\right)\:$

$\mathrm{incident}\left(4\,G\right)$

$\left\{\mathrm{e4}\,\mathrm{e5}\,\mathrm{e6}\right\}$

$\mathrm{incident}\left(4\,G\,\mathrm{In}\right)$

$\varnothing$

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

$\left\{\mathrm{e4}\,\mathrm{e5}\,\mathrm{e6}\right\}$