From fa42f8573f6da119d80e81cbaa0825ca6816bbe3 Mon Sep 17 00:00:00 2001
From: Mikkel Thestrup <mithe24@student.sdu.dk>
Date: Fri, 5 Dec 2025 11:42:22 +0100
Subject: Kinda dumb

---
 README.md | 11 -----------
 1 file changed, 11 deletions(-)

diff --git a/README.md b/README.md
index 4581aa9..ea29f50 100644
--- a/README.md
+++ b/README.md
@@ -74,14 +74,3 @@ To list all available build targets and their descriptions:
 ```bash
 make help
 ```
-
-## Adjacency List Storage: Linked List vs Array
-
-Two approaches for storing graph neighbors: linked lists and dynamic arrays.
-Benchmarks show no measurable performance difference
-despite vectors offering better cache locality.
-
-Why? Kahn's algorithm is $O(V+E) $, so memory access patterns
-likely isn't the bottleneck.
-
-Cache locality could become a bottleneck on huge graphs
-- 
cgit v1.2.3-70-g09d2