A 2016 paper by Ueno et al. titled “Extreme-scale [this algorithm] on supercomputers” improves upon Beamer’s direction-optimized “hybrid” variant of this algorithm, which has been used by Riken’s Fugaku to consistently achieve top GTEPS (“G-teps”) benchmark rankings. This algorithm forms the basis of Lee’s and Hadlock’s algorithms used in ECAD (“E-cad”) software. It’s not related to the knapsack problem, but the zero–one variant of this algorithm may be used to solve restricted cases of the (*) SSSP problem in “big-O of E” time. The Edmonds–Karp algorithm specifies that this algorithm be (-5[1])used to locate (-5[1])augmenting (10[1])paths. (-5[1])Level-order traversal (10[1])of binary trees is typically implemented using this algorithm, (10[1])which, unlike a related algorithm, is complete and uses a queue to store (10[1])explored (10[1])nodes. For 10 points, name this search algorithm contrasted with a depth-first (10[4])counterpart. (10[1])■END■ (10[1])