DigraphAbsorptionProbabilities doc: specify finiteness.

Co-authored-by: James Mitchell <james-d-mitchell@users.noreply.github.com>
digraphs · Apr 11, 2023 · e0643c3 · e0643c3
1 parent ec7cb5f
commit e0643c3
Showing 1 changed file with 1 addition and 1 deletion.
diff --git a/doc/attr.xml b/doc/attr.xml
@@ -1119,7 +1119,7 @@ gap> ArticulationPoints(D);
   <Attr Name="DigraphAbsorptionProbabilities" Arg="digraph"/>
   <Returns>A matrix of rational numbers.</Returns>
   <Description>
-    A random walk of infinite length through a digraph may pass through several
+    A random walk of infinite length through a finite digraph may pass through several
     different strongly connected components (SCCs).  However, with probability 1
     it must eventually reach an SCC which it can never leave, because the SCC
     has no out-edges leading to other SCCs.  We may say that such an SCC has