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 @@
|
||||
One negative edge: A->B 1, A->C 2, C->B -5
|
||||
==========================================
|
||||
|
||||
Dijkstra.run(g, A) throws : Dijkstra needs non-negative weights; use Bellman-Ford instead
|
||||
visited-set version, dist[B] : 1
|
||||
lazy version, check removed, dist[B]: -3 (pops 4)
|
||||
Bellman-Ford, dist[B] : -3
|
||||
Reference in New Issue
Block a user