networks(deprecated)/edges - Maple Help

networks

 edges
 finds edges in a graph

 Calling Sequence edges(G) edges(P, G) edges(P, G, 'all')

Parameters

 G - graph or network P - vertex pair, either in a set or list

Description

 • Important: The networks package has been deprecated.  Use the superseding command GraphTheory[Edges] instead.
 • This routine is used to request the names of the edges in a graph G.
 • If the only argument provided is the graph G then the names of all the edges in G are returned as a set.
 • The optional first argument P can be used to restrict the request for names to edges between a pair of vertices.
 • If P is the set {u, v} then the names of all the undirected edges between u and v  are returned.
 • If P is a list, $\left[u,v\right]$, then the names of all the edges directed from u to v are returned.
 • The third option 'all' can be used to indicate that all of the edges between u and v, regardless of direction, are desired.
 • This routine is normally loaded via the command with(networks) but may also be referenced using the full name networks[edges](...).

Examples

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

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{complete}\left(3\right):$
 > $\mathrm{edges}\left(G\right)$
 $\left\{{\mathrm{e1}}{,}{\mathrm{e2}}{,}{\mathrm{e3}}\right\}$ (1)
 > $\mathrm{addedge}\left(\left[1,2\right],G\right):$
 > $\mathrm{edges}\left(\left[1,2\right],G\right)$
 $\left\{{\mathrm{e4}}\right\}$ (2)
 > $\mathrm{edges}\left(\left\{1,2\right\},G\right)$
 $\left\{{\mathrm{e1}}\right\}$ (3)
 > $\mathrm{edges}\left(\left[2,1\right],G\right)$
 ${\varnothing }$ (4)
 > $\mathrm{edges}\left(\left\{1,2\right\},G,\mathrm{all}\right)$
 $\left\{{\mathrm{e1}}{,}{\mathrm{e4}}\right\}$ (5)