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

This procedure generates various types of complete graphs.  The number of arguments indicates the number of parts.  Each part is specified by an integer indicating the number of vertices in that part.  For example a complete bipartite graph is specified as complete(m, n).

In the case of one argument a set vset of vertex names may be specified.

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