Struct Graph 

pub struct Graph {
    pub offsets: Vec<usize>,
    pub targets: Vec<usize>,
    pub weights: Vec<f64>,
    pub n_nodes: usize,
}

A directed, weighted graph in CSR form.

Fields

offsets: Vec<usize>

offsets[i] .. offsets[i + 1] is the slice of out-edges of node i.

targets: Vec<usize>

Destination node of each out-edge, grouped by source node.

weights: Vec<f64>

Weight (e.g. length or travel time) of each out-edge.

n_nodes: usize

Number of nodes.

Implementations

impl Graph

pub fn from_edges( from: &[usize], to: &[usize], weight: &[f64], n_nodes: usize, ) -> Self

Build a CSR graph from parallel from/to/weight edge vectors.

n_nodes is the number of distinct node indices; every value in from/to must be in 0 .. n_nodes.

pub fn neighbors(&self, node: usize) -> impl Iterator<Item = (usize, f64)> + '_

Out-edges of node as (target, weight) pairs.

pub fn n_edges(&self) -> usize

Number of directed edges.