SourangshuGhosh/Reverse-Cuthill-McKee-Ordering-in-F90
The Cuthill-Mckee algorithm is used for the reordering of a symmetric square matrix. It is based on the Breadth-First Search algorithm of a graph, whose adjacency matrix is the sparsified version of the input square matrix.The ordering is frequently used when a matrix is to be generated whose rows and columns are numbered according to the numbering of the nodes. By an appropriate renumbering of the nodes, it is often possible to produce a matrix with much smaller bandwidth. The Sparsified version of a matrix is a matrix in which most of the elements are zero.The Reverse Cuthill-Mckee Algorithm is the same as the Cuthill-Mckee algorithm, the only difference is that the final indices obtained using the Cuthill-Mckee algorithm are reversed in the Reverse Cuthill-Mckee Algorithm.