pub enum EdgeData {
EdgeList(Vec<(usize, usize)>),
AdjList(Vec<(usize, Vec<usize>)>),
}
Expand description
Edges of a graph.
Variants§
EdgeList(Vec<(usize, usize)>)
Edges are given by a list of node pairs.
AdjList(Vec<(usize, Vec<usize>)>)
Edges are given by adjacency lists. The first element of each tuple is the node number, the second element is a list of adjacent nodes.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for EdgeData
impl RefUnwindSafe for EdgeData
impl Send for EdgeData
impl Sync for EdgeData
impl Unpin for EdgeData
impl UnwindSafe for EdgeData
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