From e0643c391d8297a78163ae8e12700c7b1cebf391 Mon Sep 17 00:00:00 2001
From: Michael Young <mct25@st-andrews.ac.uk>
Date: Mon, 4 Jul 2022 10:22:16 +0100
Subject: [PATCH] DigraphAbsorptionProbabilities doc: specify finiteness.

Co-authored-by: James Mitchell <james-d-mitchell@users.noreply.github.com>
---
 doc/attr.xml | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/doc/attr.xml b/doc/attr.xml
index e495c971c..74da28428 100644
--- 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