Add DigraphCycle as a synonym for CycleDigraph

doc/examples.xml

@@ -162,10 +162,11 @@ gap> ChainDigraph(IsMutableDigraph, 10);
 <#GAPDoc Label="CycleDigraph">
 <ManSection>
   <Oper Name="CycleDigraph" Arg="[filt, ]n"/>
+  <Oper Name="DigraphCycle" Arg="[filt, ]n"/>
   <Returns>A digraph.</Returns>
   <Description>
-    If <A>n</A> is a positive integer, this function returns a <E>cycle</E>
-    digraph with <A>n</A> vertices and <A>n</A> edges. Specifically,
+    If <A>n</A> is a positive integer, then these functions return a <E>cycle
+    digraph</E> with <A>n</A> vertices and <A>n</A> edges. Specifically,
     for each vertex <C>i</C> (with <C>i</C> &lt; <C>n</C>), there is a directed
     edge with source <C>i</C> and range <C>i + 1</C>. In addition, there is
     an edge with source <C>n</C> and range <C>1</C>. <P/>
@@ -184,6 +185,8 @@ gap> CycleDigraph(123);
 <immutable cycle digraph with 123 vertices>
 gap> CycleDigraph(IsMutableDigraph, 10);
 <mutable digraph with 10 vertices, 10 edges>
+gap> DigraphCycle(4) = CycleDigraph(4);
+true
 ]]></Example>
   </Description>
 </ManSection>

gap/examples.gd

@@ -36,6 +36,7 @@ DeclareOperation("ChainDigraph", [IsFunction, IsPosInt]);
 DeclareConstructor("CycleDigraphCons", [IsDigraph, IsPosInt]);
 DeclareOperation("CycleDigraph", [IsPosInt]);
 DeclareOperation("CycleDigraph", [IsFunction, IsPosInt]);
+DeclareSynonym("DigraphCycle", CycleDigraph);
 
 DeclareConstructor("JohnsonDigraphCons", [IsDigraph, IsInt, IsInt]);
 DeclareOperation("JohnsonDigraph", [IsInt, IsInt]);

tst/standard/examples.tst

@@ -92,6 +92,8 @@ gap> gr := CycleDigraph(1000);
 <immutable cycle digraph with 1000 vertices>
 gap> gr := CycleDigraph(IsMutableDigraph, 6);
 <mutable digraph with 6 vertices, 6 edges>
+gap> gr = DigraphCycle(IsImmutableDigraph, 6);
+true
 
 #  ChainDigraph
 gap> gr := ChainDigraph(0);