Simple shortest path

Given an an unweighted, undirected connected graph, we can compute the shortest path from a node $$x$$ to every other node most efficiently in, terms of time complexity by:

×