The only real difference between the algorithms in this limited case is that EXH places k-best items on local priority queues per edge, while KA * makes use of one global queue.
in addition to providing a method for speeding up k-best extraction with A * , our algorithm also provides an alternate form of Huang and Chiang (2005)'s k-best extraction that can be phrased in a weighted deduction system.