Move predecessor code into Graphs

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>
2024-05-09 23:13:49 -07:00
parent a081edb881
commit 41ada43047
2 changed files with 8 additions and 4 deletions
--- a/Language.agda
+++ b/Language.agda
@@ -86,6 +86,4 @@ record Program : Set where

    edge⇒incoming : ∀ {s₁ s₂ : State} → (s₁ , s₂) ListMem.∈ (Graph.edges graph) →
                    s₁ ListMem.∈ (incoming s₂)
-    edge⇒incoming {s₁} {s₂} s₁,s₂∈es =
-        ∈-filter⁺ (λ s' → (s' , s₂) ∈? (Graph.edges graph))
-                  (states-complete s₁) s₁,s₂∈es
+    edge⇒incoming = edge⇒predecessor graph