minor linting and documentation fixes

.gaplint_ignore

@@ -1,5 +1,6 @@
 NC
 DIGRAPHS_
+IO_
 OutNeighboursCopy
 OutNeighborsCopy
 DigraphNrVertices

doc/io.xml

@@ -536,7 +536,7 @@ gap> ReadPlainTextDigraph(filename, ",", 1, ['/','%']);
     <C>WriteDIMACSDigraph</C> records the vertices and edges of <A>digraph</A>.
     The vertex labels of <A>digraph</A> will be recorded only if they are
     integers. See <Ref Prop="IsSymmetricDigraph"/> and <Ref
-      Attr="DigraphVertexLabels"/>.<P/> 
+      Oper="DigraphVertexLabels"/>.<P/> 
 
     The first argument <A>filename</A> should be the name of the file which will
     be written to or read from.  A file can contain one symmetric digraph in

tst/standard/bliss.tst

@@ -333,8 +333,8 @@ gap> DigraphCanonicalLabelling(G, [1, 1, 1, 1, 1, 2, 2, 2, 2, 2]);
 #T# AutomorphismGroup: for a digraph with colored vertices
 gap> gr := CompleteBipartiteDigraph(4, 4);
 <digraph with 8 vertices, 32 edges>
-gap> AutomorphismGroup(gr) =
->    Group([(7,8), (6,7), (5,6), (3,4), (2,3), (1,2), (1,5)(2,6)(3,7)(4,8)]);
+gap> AutomorphismGroup(gr) = Group([
+> (7, 8), (6, 7), (5, 6), (3, 4), (2, 3), (1, 2), (1, 5)(2, 6)(3, 7)(4, 8)]);
 true
 gap> AutomorphismGroup(gr, [[1 .. 4], [5 .. 8]]);
 Group([ (7,8), (6,7), (5,6), (3,4), (2,3), (1,2) ])

tst/standard/digraph.tst

@@ -673,7 +673,7 @@ gap> gr := CycleDigraph(1);
 gap> AutomorphismGroup(gr) = Group(());
 true
 gap> gr := CycleDigraph(6);;
-gap> AutomorphismGroup(gr) = Group((1,2,3,4,5,6));
+gap> AutomorphismGroup(gr) = Group((1, 2, 3, 4, 5, 6));
 true
 gap> DigraphEdges(gr);
 [ [ 1, 2 ], [ 2, 3 ], [ 3, 4 ], [ 4, 5 ], [ 5, 6 ], [ 6, 1 ] ]
@@ -722,7 +722,7 @@ Error, no 1st choice method found for `CompleteBipartiteDigraph' on 2 argument\
 s
 gap> gr := CompleteBipartiteDigraph(4, 3);
 <digraph with 7 vertices, 24 edges>
-gap> AutomorphismGroup(gr) = Group((1,2,3,4), (1,2), (5,6,7), (5,6));
+gap> AutomorphismGroup(gr) = Group((1, 2, 3, 4), (1, 2), (5, 6, 7), (5, 6));
 true
 gap> DigraphEdges(gr);
 [ [ 1, 5 ], [ 1, 6 ], [ 1, 7 ], [ 2, 5 ], [ 2, 6 ], [ 2, 7 ], [ 3, 5 ], 
@@ -731,8 +731,8 @@ gap> DigraphEdges(gr);
   [ 7, 2 ], [ 7, 3 ], [ 7, 4 ] ]
 gap> gr := CompleteBipartiteDigraph(4, 4);
 <digraph with 8 vertices, 32 edges>
-gap> AutomorphismGroup(gr) = Group((1,2,3,4), (1,2), (5,6,7,8), (5,6),
->                                  (1,5)(2,6)(3,7)(4,8));
+gap> AutomorphismGroup(gr) = Group((1, 2, 3, 4), (1, 2), (5, 6, 7, 8), (5, 6),
+>                                  (1, 5)(2, 6)(3, 7)(4, 8));
 true
 
 #T# Equals (\=) for two digraphs

tst/testinstall.tst

@@ -266,9 +266,9 @@ gap> OutNeighbours(OnDigraphs(d, Transformation([2, 3, 1])));
 #T# Issue 42: Bug in AsDigraph for a transformation and an integer
 gap> f := Transformation([7, 10, 10, 1, 7, 9, 10, 4, 2, 3]);
 Transformation( [ 7, 10, 10, 1, 7, 9, 10, 4, 2, 3 ] )
-gap> AsDigraph(f); 
+gap> AsDigraph(f);
 <digraph with 10 vertices, 10 edges>
-gap> AsDigraph(f, 4); 
+gap> AsDigraph(f, 4);
 fail
 
 #T# DIGRAPHS_UnbindVariables