In this algorithm, the sorting is done by increasing the cost of the path to a node and the node with the least cost is expanded. It is also popularly known as Dijkstra's algorithm.
The disadvantage of this algorithm is that, since there can be multiple long paths, this technique must explore them all.
Read more at: https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm
Get Learning Android Game Development now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
Get Mark Richards’s Software Architecture Patterns ebook to better understand how to design components—and how they should interact.
Dive in for free with a 10-day trial of the O’Reilly learning platform—then explore all the other resources our members count on to build skills and solve problems every day.
Start your free trial Become a member now