You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
From Rao, The basic algorithm is fairly simple (IIRC). Start with a node at an “extremity” (loose definition) numbered 1, collect its unvisited edge connected neighbors and label/number in order and stick them in the queue, pop the next node in the queue and repeat. This is the Cuthill-McKee algorithm. If you reverse this numbering at the end of the process, it is RCM.
The text was updated successfully, but these errors were encountered:
From Rao, The basic algorithm is fairly simple (IIRC). Start with a node at an “extremity” (loose definition) numbered 1, collect its unvisited edge connected neighbors and label/number in order and stick them in the queue, pop the next node in the queue and repeat. This is the Cuthill-McKee algorithm. If you reverse this numbering at the end of the process, it is RCM.
The text was updated successfully, but these errors were encountered: