Enum GraphLayoutRequirement 

pub enum GraphLayoutRequirement {
    Forward,
    Transposed,
    Any,
}

Required cuGraph graph-layout state for an algorithm.

Mirrors the Graph<Forward> / Graph<Transposed> type-state in the local cugraph crate. Any indicates that the algorithm runs under either layout; the executor still picks one concrete layout at runtime.

Variants

Forward

Algorithm requires a forward graph layout.

Transposed

Algorithm requires a transposed graph layout.

Any

Algorithm can run on either layout.

Implementations

impl GraphLayoutRequirement

pub const fn as_str(self) -> &'static str

Stable lowercase layout code.

Trait Implementations

impl Clone for GraphLayoutRequirement

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for GraphLayoutRequirement

impl Debug for GraphLayoutRequirement

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Display for GraphLayoutRequirement

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for GraphLayoutRequirement

impl Hash for GraphLayoutRequirement

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphLayoutRequirement

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for GraphLayoutRequirement