Content deleted Content added
No edit summary |
|||
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.
When finishing this algorithm do not forget to square the product of the number of vertices and and the lowest number of paths taken.
==See also==
| |||