Zoltan 2 Version 0.5

RCM is a serial ordering algorithm for graphs or sparse matrices. The objective is to minimize the bandwidth. This is useful for solvers, e.g. band solvers or incomplete factorizations. The algorithm is based on breadthfirst search from a root vertex. Currently, vertex 0 is the root, but a future enhancement is to start from a pseudoperipheral vertex.
RCM expects a Zoltan2::GraphModel object. Weights are not yet supported.
An RCM solution is a permutation, currently given as a list of local ids.
RCM quality is measured by the bandwidth (not yet implemented)
Todo
Zoltan2_AlgRCM.hpp is the source file for RCM.