Just an afterthought and a new trial. In the structure for a sparse mat, the field mat->S[w] contains all indices of column j having weight w; moreove mat->R[j] contains all the row indices i that contain j. So it is easy from this to deduce the rows i s.t. there exists j of weight 2 in it. In this way, we can find the nodes to be visited in compute_components of prune.c a little faster I hope. This created the has2[] boolean array that is filled using ->S and ->R.
Just an afterthought and a new trial. In the structure for a sparse mat,
the field mat->S[w] contains all indices of column j having weight w; moreove
mat->R[j] contains all the row indices i that contain j. So it is easy from
this to deduce the rows i s.t. there exists j of weight 2 in it. In this way,
we can find the nodes to be visited in compute_components of prune.c a little
faster I hope. This created the has2[] boolean array that is filled using
->S and ->R.


git-svn-id: 189946a10c5fc96e9dd03ba7cba917cd4c3d09f4@491 de4796e2-0b1e-0410-91b4-86bc23549317

mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs,mancoast/cado-nfs