Apply suggestions from code review

Co-authored-by: marinaanagno <[email protected]>

doc/oper.xml

@@ -1584,9 +1584,9 @@ gap> DigraphShortestDistance(D, [1, 3], [3, 5]);
     Thomas Lengauer and Robert Endre Tarjan <Cite Key="LT79"/>. If there is
     no path from the root to a specific vertex, the output will contain a
     hole in the corresponding position. The complexity of this algorithm is 
-    <M>O(mlog n)</M> where <M>m</M> is the number of edges and <M>n</M> is the
-    number of nodes in the subdigraph induced by the nodes in <A>digraph</A>
-    reachable from <A>root</A>.
+    <M>O(mlog n)</M> where <M>m</M>  and <M>n</M> are the
+    number of edges and number of nodes in the subdigraph induced by the nodes in <A>digraph</A>
+    reachable from <A>root</A>, respectively.
     <Example><![CDATA[
 gap> D := Digraph([[2], [3, 6], [2, 4], [1], [], [3]]);
 <immutable digraph with 6 vertices, 7 edges>