Content deleted Content added
m Duplicate word removed |
→Algorithm: This sentence has no relevance to this section; it seems to be in reference to some specific implementation of the algorithm with a benchmarking of computational cost. Or someone's homework. |
||
Line 28:
*Append <math>A_i</math> to the Result set <math>R</math>.
In other words, number the vertices according to a particular [[breadth-first search|breadth-first traversal]] where neighboring vertices are visited in order from lowest to highest vertex order.
==See also==
| |||