# completeGraph -- Constructs a complete graph

## Synopsis

• Usage:
K = completeGraph n
• Inputs:
• Outputs:
• K, an instance of the type Graph, The complete graph with n vertices

## Description

A complete graph on n vertices is a graph in which all the vertices are adjacent to each other.

 i1 : K = completeGraph 5 o1 = Graph{0 => {1, 2, 3, 4}} 1 => {0, 2, 3, 4} 2 => {0, 1, 3, 4} 3 => {0, 1, 2, 4} 4 => {0, 1, 2, 3} o1 : Graph

## Ways to use completeGraph :

• "completeGraph(ZZ)"

## For the programmer

The object completeGraph is .