Struct algorithm_rs::graph::graph::Graph

pub struct Graph {
    pub n: usize,
    pub graph: Vec<Vec<(usize, usize)>>,
    pub rev: Vec<Vec<usize>>,
    pub in_degrees: Vec<usize>,
    pub out_degrees: Vec<usize>,
    pub directed: bool,
}

Fields

n: usize

graph: Vec<Vec<(usize, usize)>>

rev: Vec<Vec<usize>>

in_degrees: Vec<usize>

out_degrees: Vec<usize>

directed: bool

Implementations

impl Graph

pub fn new(n: usize, directed: bool) -> Self

pub fn connect(&mut self, from: usize, to: usize, weight: usize)

pub fn connect_unweighted(&mut self, from: usize, to: usize)

pub fn connect_with_residual(&mut self, from: usize, to: usize, weight: usize)

pub fn in_degree(&self, u: usize) -> usize

pub fn out_degree(&self, u: usize) -> usize

pub fn connected(&self, u: usize, v: usize) -> bool

Trait Implementations

impl Clone for Graph

fn clone(&self) -> Graph

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Graph

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

Formats the value using the given formatter.