devtools/eigen
1
0
Fork 0
mirror of https://gitlab.com/libeigen/eigen.git synced 2026-04-10 11:34:33 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update Ordering interface

Browse Source
This commit is contained in:
Desire NUENTSA
2012-07-06 20:18:16 +02:00
parent 203a0343fd
commit b5a83867ca
7 changed files with 67 additions and 23 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
Eigen/src/SparseLU/SparseLU_Coletree.h
View File

@@ -75,7 +75,6 @@ int LU_sp_coletree(const MatrixType& mat, IndexVector& parent)
IndexVector pp(nc); // disjoint sets
pp.setZero(); // Initialize disjoint sets
IndexVector firstcol(nr); // First nonzero column in each row
firstcol.setZero();
//Compute first nonzero column in each row
int row,col;
@@ -95,7 +94,9 @@ int LU_sp_coletree(const MatrixType& mat, IndexVector& parent)
int rset, cset, rroot;
for (col = 0; col < nc; col++)
{
cset = pp(col) = col; // Initially, each element is in its own set //FIXME
// cset = pp(col) = col; // Initially, each element is in its own set //FIXME
pp(col) = col;
cset = col;
root(cset) = col;
parent(col) = nc;
for (typename MatrixType::InnerIterator it(mat, col); it; ++it)
@@ -107,7 +108,9 @@ int LU_sp_coletree(const MatrixType& mat, IndexVector& parent)
if (rroot != col)
{
parent(rroot) = col;
cset = pp(cset) = rset; // Get the union of cset and rset //FIXME
// cset = pp(cset) = rset; // Get the union of cset and rset //FIXME
pp(cset) = rset;
cset = rset;
root(cset) = col;
}
}