From 298baf2b69620106e95b52206e02d58ad8cb9fc8 Mon Sep 17 00:00:00 2001
From: Jacques Comeaux <jacquesrcomeaux@protonmail.com>
Date: Mon, 3 Nov 2025 23:29:21 -0600
Subject: Use permutation for equivalence of hypergraphs

---
 Data/Hypergraph/Base.agda | 25 -------------------------
 1 file changed, 25 deletions(-)
 delete mode 100644 Data/Hypergraph/Base.agda

(limited to 'Data/Hypergraph/Base.agda')

diff --git a/Data/Hypergraph/Base.agda b/Data/Hypergraph/Base.agda
deleted file mode 100644
index 0910e02..0000000
--- a/Data/Hypergraph/Base.agda
+++ /dev/null
@@ -1,25 +0,0 @@
-{-# OPTIONS --without-K --safe #-}
-
-open import Level using (Level)
-open import Data.Hypergraph.Label using (HypergraphLabel)
-
-module Data.Hypergraph.Base {ℓ : Level} (HL : HypergraphLabel) where
-
-import Data.Hypergraph.Edge HL as Edge
-
-open import Data.List using (List; map)
-open import Data.Nat.Base using (ℕ)
-open import Data.String using (String; unlines)
-
-open Edge using (Edge)
-
-record Hypergraph (v : ℕ) : Set ℓ where
-  constructor mkHypergraph
-  field
-    edges : List (Edge v)
-
-normalize : {v : ℕ} → Hypergraph v → Hypergraph v
-normalize (mkHypergraph e) = mkHypergraph (Edge.sort e)
-
-show : {v : ℕ} → Hypergraph v → String
-show (mkHypergraph e) = unlines (map Edge.show e)
-- 
cgit v1.2.3