Trait graph::prelude::UndirectedNeighbors

source [−]

pub trait UndirectedNeighbors<NI> where
    NI: Idx, {
    fn neighbors(&self, node: NI) -> &[NI]ⓘNotable traits for &'_ [u8]
impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8];
}

Expand description

A graph where the order within an edge tuple is unimportant.

The edge (42, 1337) is equivalent to the edge (1337, 42).

Required methods

source

fn neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

Returns a slice of all nodes connected to the given node.

Implementors

source

Trait graph::prelude::UndirectedNeighbors

Required methods

fn neighbors(&self, node: NI) -> &[NI]ⓘNotable traits for &'_ [u8]impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]

Implementors

impl<NI, NV> UndirectedNeighbors<NI> for UndirectedCsrGraph<NI, NV, ()> where NI: Idx,

fn neighbors(&self, node: NI) -> &[NI]ⓘ
Notable traits for &'_ [u8 ]
`impl<'_> Read for &'_ [u8]impl<'_> Write for &'_ mut [u8]`

impl<NI, NV> UndirectedNeighbors<NI> for UndirectedCsrGraph<NI, NV, ()> where
NI: Idx,