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:
@@ -0,0 +1,5 @@
|
||||
A 100,000-vertex chain on a thread with a 512 KB stack
|
||||
======================================================
|
||||
|
||||
recursive DFS : StackOverflowError
|
||||
Kahn : ordered 100000 vertices, acyclic=true
|
||||
Reference in New Issue
Block a user