pub struct Input {
edges: Vec<usize>,
nodes: Vec<(usize, usize)>,
}
Expand description
Store the graph as an adjacency list.
Each node has a unique index in the nodes
vec.
Each directed edge has a unique index in the edges
vec.
Fields§
§edges: Vec<usize>
§nodes: Vec<(usize, usize)>
Implementations§
Auto Trait Implementations§
impl Freeze for Input
impl RefUnwindSafe for Input
impl Send for Input
impl Sync for Input
impl Unpin for Input
impl UnwindSafe for Input
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