Second, the existing algorithms suffer from high computational demands regarding processing time (or runtime) and memory usage, thus making them unsuitable for analyzing large-scale datasets ...

The best-first search algorithm A* allows search graphs that are trees, directed acyclic graphs or directed graphs with cycles. In real life applications of A* the search graph is generally ...