https://github.com/iffse/cuthill-mckee-f

Cuthil-Mckee algorithm
https://github.com/iffse/cuthill-mckee-f

Last synced: 3 months ago
JSON representation

Cuthil-Mckee algorithm

• Host: GitHub
• URL: https://github.com/iffse/cuthill-mckee-f
• Owner: iffse
• License: agpl-3.0
• Created: 2023-10-15T21:00:52.000Z (over 1 year ago)
• Default Branch: main
• Last Pushed: 2024-01-20T02:33:09.000Z (over 1 year ago)
• Last Synced: 2025-01-24T19:34:26.297Z (5 months ago)
• Language: Fortran
• Homepage: https://codeberg.org/iff/cuthil-mckee-f
• Size: 584 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Cuthill-Mckee Reordering

Fortran module for (Reverse) Cuchil-Mckee Reordering.

An example comparison of the nodes before and after reordering:

![example-nodes](img/example-nodes.png)

## Usage

The [module file](./src/cuthill_mckee.f90) has no dependencies and can be integrated directly into your workflow. It contains the following functions:

Functions:

- `CM_from_list`: Returns a permutation vector as computed by the Cuthill-McKee algorithm, with a list of cell as argument

- `CM_from_connection`: Returns a permutation vector as computed by the Cuthill-McKee algorithm, with connection list as argument

- `CM_from_matrix`: Returns a permutation vector as computed by the Cuthill-McKee algorithm, with adjacency matrix as argument

- `reverse`: Returns the vector in reverse order. Use this for RCM.

By list of cell we mean a matrix, where the rows represent a cell (edge, triangle, square, etc.) and the columns represent the nodes that are forming the cell. For cells with more than 3 nodes, the node at index i should be connected to the nodes at indices i-1 and i+1.

By connection list we mean a matrix, where the rows represent a node and the columns represent the nodes that are connected to the node at the row index.

By adjacency matrix we mean a matrix, where the rows and columns represent the nodes of the graph and the values represent whether the nodes are connected or not. The matrix should be symmetric, with the diagonal being all zeros. The matrix is represented as a boolean matrix.