Struct fera_graph::algs::prim::PrimAlg
source · pub struct PrimAlg<A, B, C, D, E, F>(pub A, pub B, pub C, pub D, pub E, pub F);
Tuple Fields
0: A
1: B
2: C
3: D
4: E
5: F
Implementations
sourceimpl<A, B, C, D, E, F> PrimAlg<A, B, C, D, E, F>
impl<A, B, C, D, E, F> PrimAlg<A, B, C, D, E, F>
pub fn graph<N>(self, zero: N) -> PrimAlg<N, B, C, D, E, F>
pub fn weight<N>(self, one: N) -> PrimAlg<A, N, C, D, E, F>
pub fn color<N>(self, two: N) -> PrimAlg<A, B, N, D, E, F>
pub fn parent<N>(self, three: N) -> PrimAlg<A, B, C, N, E, F>
pub fn queue<N>(self, four: N) -> PrimAlg<A, B, C, D, N, F>
pub fn _marker<N>(self, five: N) -> PrimAlg<A, B, C, D, E, N>
Trait Implementations
sourceimpl<'a, G, W, C, P, Q, T> IntoIterator for PrimAlg<&'a G, W, C, P, Q, PhantomData<T>>where
G: Incidence + VertexList,
W: EdgePropGet<G, T>,
C: ParamDerefMut,
C::Target: VertexPropMut<G, Color>,
P: ParamDerefMut,
P::Target: VertexPropMut<G, OptionEdge<G>>,
Q: ParamDerefMut<Target = BinaryHeap<QueueItem<T, Vertex<G>>>>,
T: Ord + Default,
impl<'a, G, W, C, P, Q, T> IntoIterator for PrimAlg<&'a G, W, C, P, Q, PhantomData<T>>where
G: Incidence + VertexList,
W: EdgePropGet<G, T>,
C: ParamDerefMut,
C::Target: VertexPropMut<G, Color>,
P: ParamDerefMut,
P::Target: VertexPropMut<G, OptionEdge<G>>,
Q: ParamDerefMut<Target = BinaryHeap<QueueItem<T, Vertex<G>>>>,
T: Ord + Default,
type IntoIter = Iter<'a, G, W, <C as ParamDerefMut>::Output, <P as ParamDerefMut>::Output, <Q as ParamDerefMut>::Output, T>
type IntoIter = Iter<'a, G, W, <C as ParamDerefMut>::Output, <P as ParamDerefMut>::Output, <Q as ParamDerefMut>::Output, T>
Which kind of iterator are we turning this into?
Auto Trait Implementations
impl<A, B, C, D, E, F> RefUnwindSafe for PrimAlg<A, B, C, D, E, F>where
A: RefUnwindSafe,
B: RefUnwindSafe,
C: RefUnwindSafe,
D: RefUnwindSafe,
E: RefUnwindSafe,
F: RefUnwindSafe,
impl<A, B, C, D, E, F> Send for PrimAlg<A, B, C, D, E, F>where
A: Send,
B: Send,
C: Send,
D: Send,
E: Send,
F: Send,
impl<A, B, C, D, E, F> Sync for PrimAlg<A, B, C, D, E, F>where
A: Sync,
B: Sync,
C: Sync,
D: Sync,
E: Sync,
F: Sync,
impl<A, B, C, D, E, F> Unpin for PrimAlg<A, B, C, D, E, F>where
A: Unpin,
B: Unpin,
C: Unpin,
D: Unpin,
E: Unpin,
F: Unpin,
impl<A, B, C, D, E, F> UnwindSafe for PrimAlg<A, B, C, D, E, F>where
A: UnwindSafe,
B: UnwindSafe,
C: UnwindSafe,
D: UnwindSafe,
E: UnwindSafe,
F: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more