Is traversing an unconnected graph possible?
That's a question only your professor can answer. There are at least two possible solutions:


Each "chain" involves a single connected component.
Some links will be among non-friends.


In the latter case, you would like to minimize the number of unfriendly links. If there are $c$ connected components, then you only need $c-1$ of these.