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,7 @@
|
||||
Kahn and DFS vs a transitive-closure reference on seeded random graphs
|
||||
======================================================================
|
||||
|
||||
cases checked : 3000
|
||||
cases with a cycle : 2016
|
||||
cases acyclic (orders valid): 984
|
||||
disagreements : 0
|
||||
Reference in New Issue
Block a user