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,14 @@
|
||||
Minimum spanning tree of the classic 6-vertex graph
|
||||
===================================================
|
||||
|
||||
Kruskal total weight: 33
|
||||
C - F (2)
|
||||
D - E (6)
|
||||
A - B (7)
|
||||
A - C (9)
|
||||
E - F (9)
|
||||
Prim total weight : 33
|
||||
|
||||
random graphs checked : 2000
|
||||
of which disconnected : 1330
|
||||
Kruskal/Prim disagreements : 0
|
||||
Reference in New Issue
Block a user