Struct NodeIndex 

pub struct NodeIndex { /* private fields */ }

Implementations

impl NodeIndex

pub fn new(index: usize) -> Self

Trait Implementations

impl Clone for NodeIndex

fn clone(&self) -> NodeIndex

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for NodeIndex

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

Formats the value using the given formatter.

impl<N: Clone, R: Clone> GraphTrait<NodeIndex, EdgeIndex> for Graph<N, R>

fn get_source_index(&self, edge_index: &EdgeIndex) -> NodeIndex

fn get_target_index(&self, edge_index: &EdgeIndex) -> NodeIndex

fn nodes_len(&self) -> usize

fn edges_len(&self) -> usize

fn get_nodes_ids(&self) -> Vec<NodeIndex>

impl Hash for NodeIndex

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 MemGraphId for NodeIndex

fn get_index(&self) -> usize

impl PartialEq for NodeIndex

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for NodeIndex

impl Eq for NodeIndex

impl StructuralPartialEq for NodeIndex