Ranking with min (f, h) instead of min f tends to do fewer expansions.

The idea is that among the many search nodes with best f-value, the ones further away (higher g, lower h values) are the ones that will move the fringe closer to a goal.

Having the same f-values on many nodes is common, although it's not easy to describe exactly when there's a lot of ties in a given search problem.

https://github.com/petgraph/petgraph/blob/master/src/algo/astar.rs#L137