- 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 |
||
|---|---|---|
| .. | ||
| patch | ||
| unit/unit | ||