Struct AdjacencyList 

pub struct AdjacencyList { /* private fields */ }

Simple undirected graph represented by adjacency lists.

Vertices are 0-based indices.

Implementations

impl AdjacencyList

pub fn empty() -> AdjacencyList

pub fn from_unsorted_adjacency_lists( adjacency: Vec<Vec<usize>>, ) -> AdjacencyList

pub fn from_sorted_adjacency_lists(adjacency: Vec<Vec<usize>>) -> AdjacencyList

pub fn num_vertices(&self) -> usize

pub fn degree(&self, v: usize) -> usize

pub fn neighbors(&self, v: usize) -> &[usize]

pub fn contains(&self, v: usize, neighbor: usize) -> bool

pub fn adjacency_lists(&self) -> &[Vec<usize>]

pub fn into_adjacency_lists(self) -> Vec<Vec<usize>>

pub fn distance(&self, start: usize, goal: usize) -> Option<usize>

Returns the shortest path distance between two vertices, or None if disconnected.

Panics

Panics if start or goal are out of bounds.

pub fn diameter(&self) -> Option<usize>

Returns the diameter of the graph, or None if the graph is disconnected.

Trait Implementations

impl AdjacencyStore for AdjacencyList

type Builder = AdjacencyListBuilder

impl Clone for AdjacencyList

fn clone(&self) -> AdjacencyList

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyList

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

Formats the value using the given formatter.

impl Graph for AdjacencyList

fn node_count(&self) -> usize

fn degree(&self, node: usize) -> usize

fn contains(&self, node: usize, neighbor: usize) -> bool

fn neighbors(&self, node: usize) -> impl Iterator<Item = usize>