pub struct NestedDissectionOrdering;Expand description
Nested dissection ordering algorithm.
Recursively finds vertex separators to split the graph, orders each partition recursively, then places separator vertices last. This produces a fill-reducing ordering for sparse Cholesky/LU factorization.
Implementations§
Source§impl NestedDissectionOrdering
impl NestedDissectionOrdering
Sourcepub fn compute(graph: &AdjacencyGraph) -> SolverResult<Permutation>
pub fn compute(graph: &AdjacencyGraph) -> SolverResult<Permutation>
Compute a fill-reducing permutation via nested dissection.
Auto Trait Implementations§
impl Freeze for NestedDissectionOrdering
impl RefUnwindSafe for NestedDissectionOrdering
impl Send for NestedDissectionOrdering
impl Sync for NestedDissectionOrdering
impl Unpin for NestedDissectionOrdering
impl UnsafeUnpin for NestedDissectionOrdering
impl UnwindSafe for NestedDissectionOrdering
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more