From 31be174085193e73d47cccf8555346576fd8e411 Mon Sep 17 00:00:00 2001 From: Alec Edgington Date: Tue, 2 Jan 2024 12:46:37 +0000 Subject: [PATCH] Move reindexing step. --- specification/hugr.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/specification/hugr.md b/specification/hugr.md index eead6e32c..ce989f495 100644 --- a/specification/hugr.md +++ b/specification/hugr.md @@ -1261,11 +1261,11 @@ The new hugr is then derived as follows: For each child $C$ of $P$ (in order), if $C \in S$, redirect the hierarchy edge $P \rightarrow C$ to target the next node in $N$. Stop if there are no more nodes in $N$. Add any remaining nodes in $N$ to the end of $P$'s list of children. - (Reindexing may be necessary after this step.) 6. For each node $(n, b = B(n))$ and for each child $m$ of $b$, replace the hierarchy edge from $b$ to $m$ with a hierarchy edge from the new copy of $n$ to $m$ (preserving the order). -7. Remove all nodes in $R$ and edges adjoining them. +7. Remove all nodes in $R$ and edges adjoining them. (Reindexing may be + necessary after this step.) ##### Outlining methods