Calculates a Reverse Cuthill-McKee ordering for a graph. This minimizes the bandwidth of a (sparse) symmetric matrix representation of the graph.
public class RCM| RCM | Create an RCM class working with the provided graph. |
| CalculateReordering | Create a reordering index array. The result array is intepreted like this: R[j] = i means that the vertex on index i should be moved to index j |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object) |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object) |
| GetHashCode | Serves as the default hash function. (Inherited from Object) |
| GetType | Gets the Type of the current instance. (Inherited from Object) |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object) |
| ToString | Returns a string that represents the current object. (Inherited from Object) |