From a0b633dd2b7323a3c710bb7995a787b1a093d536 Mon Sep 17 00:00:00 2001 From: Glen Huang Date: Fri, 22 Aug 2025 16:13:51 +0800 Subject: [PATCH] doc: Rephrase store-object.md --- doc/manual/source/store/store-object.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/doc/manual/source/store/store-object.md b/doc/manual/source/store/store-object.md index 10c2384fa..71ec772fb 100644 --- a/doc/manual/source/store/store-object.md +++ b/doc/manual/source/store/store-object.md @@ -20,7 +20,8 @@ The graph of references excluding self-references thus forms a [directed acyclic [directed acyclic graph]: @docroot@/glossary.md#gloss-directed-acyclic-graph -We can take the [transitive closure] of the references graph, which any pair of store objects have an edge not if there is a single reference from the first to the second, but a path of one or more references from the first to the second. +We can take the [transitive closure] of the references graph, in which any pair of store objects have an edge if a *path* of one or more references exists from the first to the second object. +(A single reference always forms a path which is one reference long, but longer paths may connect objects which have no direct reference between them.) The *requisites* of a store object are all store objects reachable by paths of references which start with given store object's references. [transitive closure]: https://en.wikipedia.org/wiki/Transitive_closure