def circular_ladder_graph(n, create_using=None):
 G = ladder_graph(n, create_using)
 G.name = ('circular_ladder_graph(%d)' % n)
 G.add_edge(0, (n - 1))
 G.add_edge(n, ((2 * n) - 1))
 return G

def circular_ladder_graph ( n , create_using = None ) : G = ladder_graph ( n , create_using ) G . name = ( 'circular_ladder_graph(%d)' % n ) G . add_edge ( 0 , ( n - 1 ) ) G . add_edge ( n , ( ( 2 * n ) - 1 ) ) return G
return the circular ladder graph cl_n of length n .