Add graph-algorithms module: Dijkstra (heap, array, lazy deletion), Bellman-Ford reference, Kahn topological sort, Union-Find strategies, Kruskal and Prim (15 tests, 13 transcripts)

Co-Authored-By: Claude Sonnet 5.5 <[email protected]>
Claude-Session: https://claude.ai/code/session_017ic4b3RckKrNbvvStS36UM
This commit is contained in:
2026-11-18 21:05:59 +05:30
co-authored by Claude Sonnet 5.5
parent eef175d669
commit 05f41a3ef7
30 changed files with 1490 additions and 0 deletions
@@ -0,0 +1,9 @@
Array scan O(V^2) vs binary heap: work counted, not timed
=========================================================
sparse V=2000 E=8000:
array version : min-scan steps 3916000
heap version : pushes 2541, pops 2541, edge scans 7784
dense V=600 E=150000:
array version : min-scan steps 360000
heap version : pushes 2292, pops 2292, edge scans 150000