← Quit0 / 0 correct
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 {
// ?
}
}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 {
// ?
}
}