Cuthill–McKee algorithm: Difference between revisions

Revision as of 01:55, 7 March 2013

Revision as of 05:58, 8 April 2013

Line 20:

The algorithm produces an ordered [[n-tuple|''n''-tuple]] ''R'' of vertices which is the new order of the vertices.

First we choose a [[peripheral vertex]] (the vertex with the lowest [[Degree (graph theory)|degree]]) ''x'' and set ''R'' := ({''x''}).

Then for <math>i = 1,2,\dots</math> we iterate the following steps while |''R''| < ''n''