Page 197 - Algorithms Notes for Professionals
P. 197
We can see that, we found node 10 at level 3. So the shortest path from source to node 10 is 3. We searched the
graph level by level and found the shortest path. Now let's erase the edges that we didn't use:
colegiohispanomexicano.net – Algorithms Notes 193
