L_d2

Standard documentation for Sparsity.etree:

 Calculate the elimination tree.

 etree(self, bool ata) -> [int]

See Direct Methods for Sparse Linear Systems by Davis (2006). If the

parameter ata is false, the algorithm is equivalent to MATLAB's etree(A), except that the indices are zero-based. If ata is true, the algorithm is equivalent to MATLAB's etree(A, 'col').

The implementation is a modified version of cs_etree in CSparse

Copyright(c) Timothy A. Davis, 2006-2009 Licensed as a derivative work

under the GNU LGPL

Extra doc: https://github.com/casadi/casadi/wiki/L_d2

Doc source: https://github.com/casadi/casadi/blob/develop/casadi/core/sparsity.hpp#L812

Implementation: https://github.com/casadi/casadi/blob/develop/casadi/core/sparsity.cpp#L591-L595

Extra documentation

To edit, see writing tips.