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

This procedure tests whether intlist is the degree sequence of a simple graph (or multigraph with no loops if 'MULTI' is specified).

If intlist is graphical (multigraphical) the procedure call returns a list of edges for one realization of intlist as a graph. Otherwise it returns FAIL.

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