2 commits

Author	SHA1	Message	Date
russell@unturf.com	bca10f42a3	liquibase-0001: fix patch correctness + add unit test (4/4 PASS) ... - Corrected fix in patch: use persistent `seen` set (no backtrack remove) so diamond shared-nodes are visited once, not 2^D times - Previous patch used DFS path-stack (cycle guard) which did not prevent the 2^D blowup for convergent diamonds - Add unit test: chained-diamond D=12 shows 334× visit reduction (16381→49) - Performance test: ArrayList→HashSet for evaluatedNodes gives 51× speedup at N=500	2026-03-29 18:25:38 -04:00
russell@unturf.com	13b449d431	liquibase-0001: DependencyGraph.recursiveSizeDepth diamond O(2^D) + evaluatedNodes O(N²); count 649→650	2026-03-29 18:19:06 -04:00