Reordering methods for Sparse matrices

Hi,

Are these functions merged and now included in scipy.sparse or
scipy.sparse.csgraph ?
If yes, I have not seen the documentation and I have missed some
points... so I'm sorry for the question.
If no, is it planned ?

Theses orderings would be a nice feature for the sparse linear algebra,
in particular for both direct and iterative solvers.
And a common version of RCM should be useful as explained in this
thread:
http://mail.scipy.org/pipermail/scipy-dev/2011-December/016786.html

Moreover, to the question: "how to draw a good line between what
belongs in scipy.sparse and what doesn't" [jakevdp] asked here:
https://github.com/scipy/scipy/pull/119
and answered [rgommers] in the same thread by:
-- should have potential uses on more than one project that depends
on scipy
-- should appear in an introductory algorithm book such as
"Introduction to Algorithms", Cormen et al.
from my experience of playing with sparse linear solvers, the useful
algorithms are: Random, column, minimum degree, Dulmage-Mendelsohn and
reverse Cuthill-McKee permutations. In other words, those included in
matlab
(http://www.mathworks.com/help/matlab/reordering-algorithms.html).

I have maybe wrong and I am just not able to find them in scipy (or
numpy).
If not, is it planned to integrate them in scipy (or numpy) ?
Are they already implemented in scikit-learn or sfepy or qutip or ... ?

cheers,
simon