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§
source§impl<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§
source§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 as ParamDerefMut>::Target: VertexPropMut<G, Color>,
P: ParamDerefMut,
<P as ParamDerefMut>::Target: VertexPropMut<G, <G as WithEdge>::OptionEdge>,
Q: ParamDerefMut<Target = BinaryHeap<QueueItem<T, <G as WithVertex>::Vertex>>>,
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 as ParamDerefMut>::Target: VertexPropMut<G, Color>,
P: ParamDerefMut,
<P as ParamDerefMut>::Target: VertexPropMut<G, <G as WithEdge>::OptionEdge>,
Q: ParamDerefMut<Target = BinaryHeap<QueueItem<T, <G as WithVertex>::Vertex>>>,
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?
source§fn into_iter(
self
) -> <PrimAlg<&'a G, W, C, P, Q, PhantomData<T>> as IntoIterator>::IntoIter
fn into_iter(
self
) -> <PrimAlg<&'a G, W, C, P, Q, PhantomData<T>> as IntoIterator>::IntoIter
Creates an iterator from a value. Read more