## Synopsis

• Usage:
• Inputs:
• Outputs:
• G, an instance of the type Graph, The circular ladder graph

## Description

The circular ladder graph corresponding to an integer n is a ladder of size n with two extra edges that connect the each top vertex with its respective bottom vertex. This creates two cycles, one inside and the other outside, that are connected by edges.

 i1 : G = circularLadder 5 o1 = Graph{0 => {1, 4, 5}} 1 => {0, 2, 6} 2 => {1, 3, 7} 3 => {2, 4, 8} 4 => {0, 3, 9} 5 => {0, 6, 9} 6 => {1, 5, 7} 7 => {2, 6, 8} 8 => {3, 7, 9} 9 => {4, 5, 8} o1 : Graph