Expand description
Approximate Minimum Degree (AMD) fill-reducing ordering.
Standalone implementation of the in-place quotient-graph AMD
algorithm (Amestoy, Davis & Duff 1996, 2004). See the crate
README and dev/plans/ordering-amd-upgrade.md for scope and
references.
Slice B is complete: mass elimination (Commit 9) and supervariable detection (Commit 10) are both live, so the ordering matches SuiteSparse / faer on the full oracle fixture suite.
The public surface conforms to the FERAL ordering-crate
contract (dev/plans/ordering-crate-contract.md). CscPattern,
OrderingStats, OrderingError, and CONTRACT_VERSION are
re-exported from feral-ordering-core.
Structs§
- AmdOptions
- Tunable parameters for AMD ordering.
- AmdStats
- Diagnostic counters collected during AMD ordering.
- AmdSubstages
- Per-sub-stage wall-clock breakdown of one AMD call.
- CscPattern
- Borrowed symmetric sparsity pattern in CSC form.
- Ordering
Stats - Diagnostic counters shared by every ordering producer.
Enums§
- Ordering
Error - Shared error shape for the ordering-crate contract.
Constants§
- CONTRACT_
VERSION - Version of the shared ordering-crate contract.
Functions§
- amd_
order - Compute a fill-reducing AMD ordering.
- amd_
order_ full - Contract-conforming ordering producer.
- amd_
order_ opts - Compute an AMD ordering with explicit options.
- amd_
order_ substages - Compute an AMD ordering and report a per-sub-stage timing breakdown.
- amd_
order_ with_ stats - Compute an AMD ordering and return the crate-specific diagnostic counters.