Content deleted Content added
m r2.7.2+) (Robot: Modifying ru:Алгоритм Катхилла — Макки |
m link Level structure |
||
Line 8:
The Cuthill McKee algorithm is a variant of the standard [[breadth-first search]]
algorithm used in graph algorithms. It starts with a peripheral node and then
generates [[Level structure|levels]] <math>R_i</math> for <math>i=1, 2,..</math> until all nodes
are exhausted. The set <math> R_{i+1} </math> is created from set <math> R_i</math>
by listing all vertices adjacent to all nodes in <math> R_i </math>. These
| |||