From 7a00f88749b00c7eb0404872b21e36adb17d8456 Mon Sep 17 00:00:00 2001
From: Mikkel Thestrup <mithe24@student.sdu.dk>
Date: Fri, 5 Dec 2025 11:33:16 +0100
Subject: Small changes

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

(limited to 'README.md')

diff --git a/README.md b/README.md
index ea29f50..4581aa9 100644
--- a/README.md
+++ b/README.md
@@ -74,3 +74,14 @@ 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