Closed danielz9999 closed 2 months ago
Thank you for contributing this! I'll take a closer look when I have bit more time next week.
Refactored the implementation a bunch to avoid code reduplication and improve style consistency! I will likely make more performance improvements to the implementation in the main branch (e.g. avoid re-running the entire RPG search multiple times), but I think this can be merged now.
Thanks again for contributing this @danielz9999! It was very helpful for understanding how LMCut works and is implemented.
Adds the Lm-Cut heuristic to heuristics as well as tests for it. Uses a modified version of the relaxed_pgraph_search function to get hmax costs and then runs the Lm-Cut algorithm.