From 36797494d8b60813a424a791c9a2a7fbd1b46f07 Mon Sep 17 00:00:00 2001
From: Michael Young <mct25@st-andrews.ac.uk>
Date: Thu, 8 Feb 2024 10:40:48 +0000
Subject: [PATCH] weights.xml: Adjust formatting in doc

---
 doc/weights.xml | 12 ++++++++----
 1 file changed, 8 insertions(+), 4 deletions(-)

diff --git a/doc/weights.xml b/doc/weights.xml
index e71fa6833..f546d590f 100644
--- a/doc/weights.xml
+++ b/doc/weights.xml
@@ -86,7 +86,8 @@ gap> EdgeWeights(g);
 
         See <Ref Attr="EdgeWeights" Func="EdgeWeightedDigraph"/>.
     <Example><![CDATA[
-gap> g := EdgeWeightedDigraph([[2], [1], [1, 2]], [[12], [5], [6, 9]]);
+gap> g := EdgeWeightedDigraph([[2], [1], [1, 2]],
+>                             [[12], [5], [6, 9]]);
 <immutable digraph with 3 vertices, 4 edges>
 gap> DigraphEdgeWeightedMinimumSpanningTree(g);
 rec( mst := <immutable digraph with 3 vertices, 2 edges>, total := 11 
@@ -115,12 +116,14 @@ rec( mst := <immutable digraph with 3 vertices, 2 edges>, total := 11
 
         See <Ref Attr="EdgeWeights" Func="EdgeWeightedDigraph"/>.
     <Example><![CDATA[
-gap> g := EdgeWeightedDigraph([[2, 3], [4], [4], []], [[5, 1], [6], [11], []]);
+gap> g := EdgeWeightedDigraph([[2, 3], [4], [4], []],
+>                             [[5, 1], [6], [11], []]);
 <immutable digraph with 4 vertices, 4 edges>
 gap> DigraphEdgeWeightedShortestPath(g, 1);
 rec( distances := [ 0, 5, 1, 11 ], edges := [ fail, 1, 2, 1 ], 
   parents := [ fail, 1, 1, 2 ] )
-gap> ncg := EdgeWeightedDigraph([[2], [3], [1]], [[-1], [-2], [-3]]);
+gap> ncg := EdgeWeightedDigraph([[2], [3], [1]],
+>                               [[-1], [-2], [-3]]);
 <immutable digraph with 3 vertices, 3 edges>
 gap> DigraphEdgeWeightedShortestPath(ncg, 1);
 Error, negative cycle exists,
@@ -169,7 +172,8 @@ rec( distances := [ [ 0, 1, 3 ], [ 5, 0, 2 ], [ 3, 4, 0 ] ],
 
         See <Ref Attr="EdgeWeights" Func="EdgeWeightedDigraph"/>.
     <Example><![CDATA[
-gap> g := EdgeWeightedDigraph([[2, 2], [3], []], [[3, 2], [1], []]);
+gap> g := EdgeWeightedDigraph([[2, 2], [3], []],
+>                             [[3, 2], [1], []]);
 <immutable multidigraph with 3 vertices, 3 edges>
 gap> DigraphMaximumFlow(g, 1, 3);
 rec( flows := [ [  ], [ 1, 0 ], [ 1 ] ], maxFlow := 1,