code: def CyclicGroup(n):
      """
      Generates the cyclic group of order ``n`` as a permutation group.
  
      Explanation
      ===========
  
      The generator taken is the ``n``-cycle ``(0 1 2 ... n-1)``
      (in cycle notation). After the group is generated, some of its basic
      properties are set.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.named_groups import CyclicGroup
      >>> G = CyclicGroup(6)
      >>> G.is_group
      True
      >>> G.order()
      6
      >>> list(G.generate_schreier_sims(af=True))
      [[0, 1, 2, 3, 4, 5], [1, 2, 3, 4, 5, 0], [2, 3, 4, 5, 0, 1],
      [3, 4, 5, 0, 1, 2], [4, 5, 0, 1, 2, 3], [5, 0, 1, 2, 3, 4]]
  
      See Also
      ========
  
      SymmetricGroup, DihedralGroup, AlternatingGroup
  
      """
      a = list(range(1, n))
      a.append(0)
      gen = _af_new(a)
      G = PermutationGroup([gen])
  
      G._is_abelian = True
      G._is_nilpotent = True
      G._is_solvable = True
      G._degree = n
      G._is_transitive = True
      G._order = n
      G._is_dihedral = n == 2
      return G
  
file_path: sympy/sympy/combinatorics/named_groups.py
imports: from sympy.combinatorics.group_constructs import DirectProduct
  from sympy.combinatorics.perm_groups import PermutationGroup
  from sympy.combinatorics.permutations import Permutation
label_desc: Use image node_id 4 for calling a global function with example usage: CyclicGroup(n) and returns: G