← Quit0 / 0 correct
RustHard1 of 283

How should a priority struct implement Ord for BinaryHeap to pop the lowest cost first?

impl Ord for State {
    fn cmp(&self, other: &Self) -> Ordering {
        // ?
    }
}