weights: tweak whitespace (#722)

digraphs · Jan 23, 2025 · 6b7eee1 · 6b7eee1
1 parent 7243835
commit 6b7eee1
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 7 deletions.
diff --git a/doc/weights.xml b/doc/weights.xml
@@ -8,7 +8,6 @@
 #############################################################################
 ##
 
-
 <#GAPDoc Label="EdgeWeights">
     <ManSection>
     <Attr Name="EdgeWeights" Arg="digraph"/>
@@ -24,7 +23,7 @@
     lists, whereas the function <C>EdgeWeightsMutableCopy</C> returns a copy
     of <C>EdgeWeights</C> which is a mutable list of mutable lists.<P/>
 
-    The edge weights of a digraph cannot be computed and must be set either 
+    The edge weights of a digraph cannot be computed and must be set either
     using <C>SetEdgeWeights</C> or <Ref Func="EdgeWeightedDigraph" />.<P/>
     <Example><![CDATA[
 gap> gr := EdgeWeightedDigraph([[2], [3], [1]], [[5], [10], [15]]);
@@ -80,7 +79,7 @@ gap> EdgeWeights(g);
         returns the sum of the weights of its edges.<P/>
 
         &MUTABLE_RECOMPUTED_ATTR;
-      
+
         See <Ref Attr="EdgeWeights"/>.
     <Example><![CDATA[
 gap> D := EdgeWeightedDigraph([[2], [1], [1, 2]],
@@ -100,7 +99,7 @@ gap> EdgeWeightedDigraphTotalWeight(D);
         If <A>digraph</A> is a connected digraph with edge weights, then this
         attribute returns a digraph which is a minimum spanning tree of
         <A>digraph</A>.<P/>
-      
+
         A <E>spanning tree</E> of a digraph is a subdigraph with the same
         vertices but a subset of its edges that form an undirected tree.  It is
         <E>minimum</E> if it has the smallest possible total weight for a

diff --git a/tst/standard/weights.tst b/tst/standard/weights.tst
@@ -110,13 +110,13 @@ gap> EdgeWeightedDigraphMinimumSpanningTree(d);
 # digraph with cycle
 gap> d := EdgeWeightedDigraph([[2], [3], [1]], [[5], [10], [15]]);
 <immutable digraph with 3 vertices, 3 edges>
-gap> tree := EdgeWeightedDigraphMinimumSpanningTree(d);              
+gap> tree := EdgeWeightedDigraphMinimumSpanningTree(d);
 <immutable digraph with 3 vertices, 2 edges>
 gap> EdgeWeightedDigraphTotalWeight(tree);
 15
 
 # digraph with negative edge
-gap> d := EdgeWeightedDigraph([[2], []], [[-5], []]);  
+gap> d := EdgeWeightedDigraph([[2], []], [[-5], []]);
 <immutable digraph with 2 vertices, 1 edge>
 gap> EdgeWeightedDigraphMinimumSpanningTree(d);
 <immutable digraph with 2 vertices, 1 edge>
@@ -128,7 +128,7 @@ gap> EdgeWeightedDigraphMinimumSpanningTree(d);
 <immutable digraph with 3 vertices, 2 edges>
 
 # digraph with parallel edges
-gap> d := EdgeWeightedDigraph([[2, 2, 2], [1]], [[10, 5, 15], [7]]);  
+gap> d := EdgeWeightedDigraph([[2, 2, 2], [1]], [[10, 5, 15], [7]]);
 <immutable multidigraph with 2 vertices, 4 edges>
 gap> EdgeWeightedDigraphMinimumSpanningTree(d);
 <immutable digraph with 2 vertices, 1 edge>