As mentioned earlier, one problem of best-first is the lack of theoretical guarantee on time complexity.
a time constraint is used and default output can be constructed when no full output is found (White, 2004b;Zhang and Clark, 2011b).