Update doc/oper.xml

digraphs · Dec 22, 2020 · 7d4025f · 7d4025f
1 parent 99b25cc
commit 7d4025f
Showing 1 changed file with 10 additions and 7 deletions.
diff --git a/doc/oper.xml b/doc/oper.xml
@@ -1755,13 +1755,16 @@ gap> DigraphDijkstra(D, 1, 2);
   <C>[a, b]</C> has label <C>(a - 1) * |V2| + b</C> in the  output). There is
   an edge from <C>[a, b]</C> to <C>[c, d]</C> precisely when the following
   two conditions are satisfied:
-<List>
-  <Item> The vertices <C>a</C> and <C>c</C> of <A>D1</A> are equal if and only if
-     the vertices <C>b</C> and <C>d</C> of <A>D2</A> are equal.</Item>
-
-  <Item> There is an edge from <C>a</C> to <C>c</C> in <A>D1</A> if and only if
-     there is an edge from <C>b</C> to <C>d</C> in <A>D2</A>.</Item>
-   </List>
+  <List>
+    <Item>
+      The vertices <C>a</C> and <C>c</C> of <A>D1</A> are equal if and only if
+      the vertices <C>b</C> and <C>d</C> of <A>D2</A> are equal.
+    </Item>
+    <Item>
+      There is an edge from <C>a</C> to <C>c</C> in <A>D1</A> if and only if
+      there is an edge from <C>b</C> to <C>d</C> in <A>D2</A>.
+    </Item>
+  </List>
 
   Notably, the complete (with loops) subdigraphs of <C>MPD</C> are
   precisely the partial isomorphisms from <A>D1</A> to <A>D2</A>.