Struct scotch::graph::Data

#[non_exhaustive]
pub struct Data<'d> {
    pub baseval: Num,
    pub verttab: &'d [Num],
    pub vendtab: &'d [Num],
    pub velotab: &'d [Num],
    pub vlbltab: &'d [Num],
    pub edgetab: &'d [Num],
    pub edlotab: &'d [Num],
}

Deconstructed graph data.

Invariants

This structure ensures the following invariants are met:

• if vendtab is empty,
  1. verttab must be non-empty,
  2. velotab, if non-empty, must have exactly one less element than verttab, and
  3. vlbltab, if non-empty, must have exactly one less element than verttab,
• if vendtab is non-empty,
  1. verttab and vendtab must have the same length,
  2. velotab, if non-empty, must have the same length as verttab, and
  3. vlbltab, if non-empty, must have the same length as verttab,
• edlotab, if non-empty, must have the same length as edgetab,
• The length of verttab must fit in a Num,
• The length of edgetab must fit in a Num.

Fields (Non-exhaustive)

Non-exhaustive structs could have additional fields added in future. Therefore, non-exhaustive structs cannot be constructed in external crates using the traditional Struct { .. } syntax; cannot be matched against without a wildcard ..; and struct update syntax will not work.

baseval: Num

Graph base value for arrays (typically 0).

verttab: &'d [Num]

Adjency start index array.

Adjacent nodes of node #i are stored in &edgetab[verttab[i]..vendtab[i]].

vendtab: &'d [Num]

Adjency end index array.

Adjacent nodes of node #i are stored in &edgetab[verttab[i]..vendtab[i]].

This is typically empty, and Scotch sets it to the default &verttab[1..].

velotab: &'d [Num]

Vertex load array.

vlbltab: &'d [Num]

Vertex label array.

edgetab: &'d [Num]

Adjency array.

edlotab: &'d [Num]

Edge load array.

Implementations

impl<'d> Data<'d>

pub fn new( baseval: Num, verttab: &'d [Num], vendtab: &'d [Num], velotab: &'d [Num], vlbltab: &'d [Num], edgetab: &'d [Num], edlotab: &'d [Num] ) -> Data<'d>

Group-up graph data.

Panics

The invariants of Data must be uphold, otherwise this function will panic.

pub fn vertnbr(&self) -> Num

The number of vertices.