pub struct Day23 { /* private fields */ }
Expand description
2024 Day 23: Finding the largest clique in a graph.
Assumes each node has the same degree N, and the largest clique contains N nodes.
Implementations§
Trait Implementations§
Auto Trait Implementations§
impl Freeze for Day23
impl RefUnwindSafe for Day23
impl Send for Day23
impl Sync for Day23
impl Unpin for Day23
impl UnwindSafe for Day23
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more