Struct graph::prelude::EdgeListInput
source · pub struct EdgeListInput<NI, EV = ()>where
NI: Idx,{ /* private fields */ }Expand description
Reads a graph from a file that contains an edge per line.
An edge is represented by a source node id and a target node id. The two node ids must be separated by a 1-byte character (e.g. whitespace or tab).
The node count of the resulting graph is the highest node id within the file plus one. The edge count will be twice the number of lines in the file.
Example
ⓘ
> cat my_graph.edgelist
0 1
0 2
1 3
2 0Trait Implementations§
source§impl<NI, EV> Default for EdgeListInput<NI, EV>where
NI: Idx,
impl<NI, EV> Default for EdgeListInput<NI, EV>where NI: Idx,
source§fn default() -> EdgeListInput<NI, EV>
fn default() -> EdgeListInput<NI, EV>
Returns the “default value” for a type. Read more
source§impl<NI, EV> InputCapabilities<NI> for EdgeListInput<NI, EV>where
NI: Idx,
impl<NI, EV> InputCapabilities<NI> for EdgeListInput<NI, EV>where NI: Idx,
type GraphInput = EdgeList<NI, EV>
Auto Trait Implementations§
impl<NI, EV> RefUnwindSafe for EdgeListInput<NI, EV>where EV: RefUnwindSafe, NI: RefUnwindSafe,
impl<NI, EV> Send for EdgeListInput<NI, EV>where EV: Send,
impl<NI, EV> Sync for EdgeListInput<NI, EV>where EV: Sync,
impl<NI, EV> Unpin for EdgeListInput<NI, EV>where EV: Unpin, NI: Unpin,
impl<NI, EV> UnwindSafe for EdgeListInput<NI, EV>where EV: UnwindSafe, NI: UnwindSafe,
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