From 90a98fd27f781aadd57ff94b92b6b78859b46cb6 Mon Sep 17 00:00:00 2001 From: Alec Edgington Date: Tue, 2 Jan 2024 12:51:56 +0000 Subject: [PATCH] Revert "Define an identity node for CFGs." This reverts commit 37a5f723b354d60acb2f797e31e37c20198ed192. --- specification/hugr.md | 11 ++++------- 1 file changed, 4 insertions(+), 7 deletions(-) diff --git a/specification/hugr.md b/specification/hugr.md index ba91458ec..c9fb82b15 100644 --- a/specification/hugr.md +++ b/specification/hugr.md @@ -408,8 +408,6 @@ Some normalizations are possible: - If the entry node has only one successor and that successor is the exit node, the CFG node itself can be removed. -An special `passthrough` `DFB` is defined having no effect on the data. - The CFG in the example below has three inputs: one (call it `v`) of type "P" (not specified, but with a conversion to boolean represented by the nodes labelled "P?1" and "P?2"), one of type "qubit" and one (call it `t`) of type "angle". @@ -1325,14 +1323,13 @@ the children of that CFG node. ###### `InsertIdentity` -Given an edge between sibling nodes in a DSG or CFG, insert an `identity` or -`passthrough` node having its source as predecessor and its target as -successor. +Given an edge between sibling nodes in a DSG, insert an `identity` +node having its source as predecessor and its target as successor. ###### `RemoveIdentity` -Remove an `identity` node from a DSG, or a `passthrough` node from a CFG, -wiring its predecessor to its successor. +Remove an `identity` node from a DSG, wiring its predecessor to its +successor. ##### Order insertion and removal methods