Struct rs_graph::linkedlistgraph::LinkedListGraphBuilder
source · pub struct LinkedListGraphBuilder<ID, N, E> { /* private fields */ }
Expand description
A builder for a LinkedListGraph.
The basic task is to arrange the final outgoing and incoming edges in the linked lists appropriately (i.e. first outgoing, then incoming edges).
Trait Implementations§
source§impl<ID, N, E> Builder for LinkedListGraphBuilder<ID, N, E>where
ID: PrimInt + Unsigned + 'static,
N: Default,
E: Default,
impl<ID, N, E> Builder for LinkedListGraphBuilder<ID, N, E>where ID: PrimInt + Unsigned + 'static, N: Default, E: Default,
§type Graph = LinkedListGraph<ID, N, E>
type Graph = LinkedListGraph<ID, N, E>
The graph type produced by this builder.
source§fn with_capacities(nnodes: usize, nedges: usize) -> Self
fn with_capacities(nnodes: usize, nedges: usize) -> Self
Create a new, empty builder. Read more
source§fn reserve(&mut self, nnodes: usize, nedges: usize)
fn reserve(&mut self, nnodes: usize, nedges: usize)
Reserve memory for a certain number of nodes and edges.
source§fn into_graph(self) -> LinkedListGraph<ID, N, E>
fn into_graph(self) -> LinkedListGraph<ID, N, E>
Turn the builder into a graph.
Auto Trait Implementations§
impl<ID, N, E> RefUnwindSafe for LinkedListGraphBuilder<ID, N, E>where E: RefUnwindSafe, ID: RefUnwindSafe, N: RefUnwindSafe,
impl<ID, N, E> Send for LinkedListGraphBuilder<ID, N, E>where E: Send, ID: Send, N: Send,
impl<ID, N, E> Sync for LinkedListGraphBuilder<ID, N, E>where E: Sync, ID: Sync, N: Sync,
impl<ID, N, E> Unpin for LinkedListGraphBuilder<ID, N, E>where E: Unpin, ID: Unpin, N: Unpin,
impl<ID, N, E> UnwindSafe for LinkedListGraphBuilder<ID, N, E>where E: UnwindSafe, ID: UnwindSafe, N: 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