Grammar corrections

digraphs · Jan 26, 2022 · bb363ed · bb363ed
1 parent 620d5f3
commit bb363ed
Showing 1 changed file with 6 additions and 6 deletions.
diff --git a/tst/standard/attr.tst b/tst/standard/attr.tst
@@ -489,19 +489,19 @@ gap> DigraphShortestDistances(gr);
 #  UnweightedBellmanFord
 gap> gr := Digraph([[1, 2], [3], [1, 2], [4]]);
 <immutable digraph with 4 vertices, 6 edges>
-gap> UnweightedBellmanFord(gr,2);
+gap> UnweightedBellmanFord(gr, 2);
 [ [ 2, 0, 1, fail ], [ 3, fail, 2, fail ] ]
 gap> gr := CycleDigraph(IsMutableDigraph, 3);
 <mutable digraph with 3 vertices, 3 edges>
-gap> UnweightedBellmanFord(gr,3);
+gap> UnweightedBellmanFord(gr, 3);
 [ [ 1, 2, 0 ], [ 3, 1, fail ] ]
-gap> gr := Digraph([[],[]]);
+gap> gr := Digraph([[], []]);
 <immutable empty digraph with 2 vertices>
-gap> UnweightedBellmanFord(gr,2);
+gap> UnweightedBellmanFord(gr, 2);
 [ [ fail, 0 ], [ fail, fail ] ]
-gap> gr := Digraph([[1],[2],[3],[4]]);
+gap> gr := Digraph([[1], [2], [3], [4]]);
 <immutable digraph with 4 vertices, 4 edges>
-gap> UnweightedBellmanFord(gr,2);
+gap> UnweightedBellmanFord(gr, 2);
 [ [ fail, 0, fail, fail ], [ fail, fail, fail, fail ] ]
 
 #  OutNeighbours and InNeighbours