networks(deprecated)/void - Maple Help

networks

 void
 generate a void graph

 Calling Sequence void(n) void(vset)

Parameters

 n - integer indicating the number of vertices vset - set or list of vertex names

Description

 • Important: The networks package has been deprecated.Use the superseding command GraphTheory[Graph] instead.
 • This procedure generates void graphs, i.e. graphs with n vertices and no edges. (Specific vertices may be provided as a set.) It is normally loaded via the command with(networks) but may also be referenced using the full name networks[void](...).

Examples

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

 > $\mathrm{with}\left(\mathrm{networks}\right):$
 > $G≔\mathrm{void}\left(10\right):$
 > $\mathrm{vertices}\left(G\right)$
 $\left\{{1}{,}{2}{,}{3}{,}{4}{,}{5}{,}{6}{,}{7}{,}{8}{,}{9}{,}{10}\right\}$ (1)
 > $\mathrm{edges}\left(G\right)$
 ${\varnothing }$ (2)
 > $\mathrm{show}\left(\mathrm{void}\left(\left\{\mathrm{zurich},\mathrm{saskatchewan},\mathrm{waterloo}\right\}\right)\right)$
 ${table}{}\left(\left[{\mathrm{_Vweight}}{=}{table}{}\left({\mathrm{sparse}}{,}\left[\right]\right){,}{\mathrm{_Neighbors}}{=}{table}{}\left(\left[{\mathrm{saskatchewan}}{=}{\varnothing }{,}{\mathrm{zurich}}{=}{\varnothing }{,}{\mathrm{waterloo}}{=}{\varnothing }\right]\right){,}{\mathrm{_Vertices}}{=}\left\{{\mathrm{zurich}}{,}{\mathrm{saskatchewan}}{,}{\mathrm{waterloo}}\right\}{,}{\mathrm{_Econnectivity}}{=}{\mathrm{_Econnectivity}}{,}{\mathrm{_Countcuts}}{=}{\mathrm{_Countcuts}}{,}{\mathrm{_Edges}}{=}{\varnothing }{,}{\mathrm{_Counttrees}}{=}{\mathrm{_Counttrees}}\right]\right)$ (3)