Struct Graph 

pub struct Graph {
    pub nodes: Vec<Node>,
    pub offsets: Vec<u32>,
    pub edges: Vec<Edge>,
}

Fields

nodes: Vec<Node>

offsets: Vec<u32>

CSR: offsets[i]..offsets[i + 1] indexes into edges for node i. offsets.len() == nodes.len() + 1.

edges: Vec<Edge>

Implementations

impl Graph

pub fn solve_cycle(&mut self) -> bool

Exact weighted solution of a connected simple cycle with one anchor. A chain plus one root-to-last loop has this topology regardless of node/edge order. Reject other graphs and solutions outside Huber’s quadratic region (6px), leaving the general solver untouched.

pub fn pass(&mut self, reverse: bool) -> f64

One Gauss-Seidel sweep over every unpinned node with edges, mutating positions in place exactly as optimize()’s per-node loop does: a neighbour update earlier in this same sweep is visible to a later one in it (via self.nodes, not a snapshot). Returns the largest single-node displacement (maxChange).

pub fn residual(&self) -> f64

Largest edge residual over the current positions — same node/edge visitation order as optimize()’s trailing residual loop (ascending node index, then edge order within each node).