Min heap more suitable for algorithms such as Dijkstra and A* than Rust’s default max heap. Splits the sorting key and value, so that you can order items without having to implement Ord on the value type.
Ord