diff options
| author | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-05 11:42:22 +0100 |
|---|---|---|
| committer | Mikkel Thestrup <mithe24@student.sdu.dk> | 2025-12-05 11:42:22 +0100 |
| commit | fa42f8573f6da119d80e81cbaa0825ca6816bbe3 (patch) | |
| tree | a4cb26130392a0b823b617844f7efcc8e3c04cc4 /README.md | |
| parent | 7a00f88749b00c7eb0404872b21e36adb17d8456 (diff) | |
| download | cycle-detector-fa42f8573f6da119d80e81cbaa0825ca6816bbe3.tar.gz cycle-detector-fa42f8573f6da119d80e81cbaa0825ca6816bbe3.zip | |
Kinda dumb
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 11 |
1 files changed, 0 insertions, 11 deletions
@@ -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 |