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