Finding spanning spiders Is there a polynomial-time algorithm to find&mdash;if one exists&mdash;a spanning spider
of a given graph $G$?  A spider is a tree with at most one node with degree greater than 2:
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;
I know that various degree conditions on $G$ (essentially, sufficiently large node degrees) guarantee the existence of a spanning spider.  But I am wondering if there is an algorithm for arbitrary $G$.  Thanks!
The question has been answered in the comments by Tsuyoshi &amp; Chandra!  I am adding this CW answer so I can accept it to indicate the question is closed.  Thanks, everyone!