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,6 @@
|
||||
Bellman-Ford with int infinity: 2 -> 3 is unreachable from 0
|
||||
============================================================
|
||||
|
||||
Integer.MAX_VALUE + 5 = -2147483644
|
||||
int version, dist[3] : -2147483644
|
||||
long + check, dist[3] : unreachable (INF)
|
||||
Reference in New Issue
Block a user