Content deleted Content added
m (GR) File renamed: File:Can 73 rcm svg.svg → File:Can 73 rcm.svg Criterion 6 (maintenance or bug fix) |
It's important to say that level sets are sorted by predecessor. The code in the cited blogspot explores the next level one vertex at a time from a queue, so it's not made explicit there. But this code takes R_i all at once and sorts it, so predecessor must be used to compare. The slides I cite make this clearer. |
||
Line 10:
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
nodes are
==Algorithm==
Line 25 ⟶ 24:
*Construct the adjacency set <math>A_i</math> of <math>R_i</math> (with <math>R_i</math> the ''i''-th component of <math>R</math>) and exclude the vertices we already have in <math>R</math>
:<math>A_i := \operatorname{Adj}(R_i) \setminus R</math>
*Sort <math>A_i</math>
*Append <math>A_i</math> to the Result set <math>R</math>.
In other words, number the vertices according to a particular [[
==See also==
| |||
