Struct DirectedGraph 

pub struct DirectedGraph {
    pub n_nodes: usize,
    pub edges: Vec<DirectedEdge>,
    pub out_adj: Vec<Vec<(usize, f64)>>,
    pub in_adj: Vec<Vec<(usize, f64)>>,
}

A directed weighted graph with per-node in-edge and out-edge lists.

Fields

n_nodes: usize

Number of nodes.

edges: Vec<DirectedEdge>

All edges.

out_adj: Vec<Vec<(usize, f64)>>

Out-adjacency list: out_adj[i] = list of (dst, weight).

in_adj: Vec<Vec<(usize, f64)>>

In-adjacency list: in_adj[i] = list of (src, weight).

Implementations

impl DirectedGraph

pub fn new(n_nodes: usize) -> Self

Create an empty directed graph with n_nodes nodes.

pub fn add_edge(&mut self, src: usize, dst: usize, weight: f64)

Add a directed weighted edge from src to dst.

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

Out-degree of node v.

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

In-degree of node v.

Trait Implementations

impl Clone for DirectedGraph

fn clone(&self) -> DirectedGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DirectedGraph

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

Formats the value using the given formatter.