# COLAMD

Column approximate minimum degree ordering algorithm.

## About

`colamd` implements approximate minimum degree column ordering
algorithms for LU, Cholesky and QR factorization, least squares, interior
point methods for linear programming, and other related problems.

## License and Copyright

Copyright (C) 1998-2016 Stefan I. Larimore and Timothy A. Davis.  
Copyright (C) 2011-2022 Richard W. Lincoln.

The authors of the original C code are Stefan I. Larimore and Timothy A.
Davis (davis at cise.ufl.edu), University of Florida. The algorithm was
developed in collaboration with John Gilbert, Xerox PARC, and Esmond
Ng, Oak Ridge National Laboratory.

This work was supported by the National Science Foundation, under
grants DMS-9504974 and DMS-9803599.

The original [COLAMD](http://suitesparse.com) library by Stefan I. Larimore
and Timothy A. Davis was translated from C to [Rust](https://www.rust-lang.org/)
by Richard W. Lincoln.

Use of this source code is governed by the BSD 3-clause license
([License.txt](License.txt) or https://opensource.org/licenses/BSD-3-Clause).