We are given as input an undirected graph G = (V, E), a source vertcx s E V, and an integer k > 0. We want to output all vertices within k hops from s. Here, we say that v is within k hops from s if...

Extracted text: We are given as input an undirected graph G = (V, E), a source vertcx s E V, and an integer k > 0. We want to output all vertices within k hops from s. Here, we say that v is within k hops from s if there is a path from s to v consisting of at most k cdges. Describe your algorithm.