Struct AdjacencyMatrix 

pub struct AdjacencyMatrix {
    pub n: usize,
    pub mat: Vec<bool>,
}

Unweighted graph stored as a dense row-major boolean matrix.

Fields

n: usize

mat: Vec<bool>

Implementations

impl AdjacencyMatrix

pub fn new(n: usize) -> Self

Create an empty (all-false) matrix with n nodes.

pub fn set(&mut self, u: usize, v: usize, value: bool) -> GraphalgResult<()>

Set the directed edge u -> v to value.

pub fn add_edge(&mut self, u: usize, v: usize) -> GraphalgResult<()>

Add directed edge u -> v.

pub fn add_undirected_edge(&mut self, u: usize, v: usize) -> GraphalgResult<()>

Add an undirected edge (u, v).

pub fn has_edge(&self, u: usize, v: usize) -> GraphalgResult<bool>

Get the value of the directed edge u -> v.

pub fn num_edges(&self) -> usize

Number of directed edges (true entries).

Trait Implementations

impl Clone for AdjacencyMatrix

fn clone(&self) -> AdjacencyMatrix

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for AdjacencyMatrix

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

Formats the value using the given formatter.