Struct BlockAdjacency 

pub struct BlockAdjacency { /* private fields */ }

The finalized, consolidated block structure of a BlockMatrix, indexed both by row and by column (see BlockMatrix::finish’s doc comment for why both are needed rather than one derived from the other on demand).

Implementations

impl BlockAdjacency

pub fn n(&self) -> usize

pub fn row(&self, i: usize) -> &[(usize, Block2)]

pub fn col(&self, j: usize) -> &[(usize, Block2)]

All (row, block) pairs with a nonzero block in column j, sorted by row. block is the real A[row][j] value — not A[j][row] reused under a symmetry assumption, since the Jacobian doesn’t satisfy one (see BlockMatrix::finish).

pub fn get(&self, i: usize, j: usize) -> Block2

pub fn colamd_order(&self) -> Vec<usize>

Computes a fill-reducing column permutation over the collapsed bus-level structural graph (one node per bus, ignoring the internal 2×2 block contents — colamd’s ordering is purely structural), reusing faer’s tested colamd::order rather than hand-writing an ordering heuristic. perm[k] = the original bus index placed at elimination position k.