1 files changed, 11 insertions, 0 deletions
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