graph: depth first search

Hi, I'd like to use depth_first_search to check whether a particular vertex is reachable from the root vertex. Is there a way to stop the search when the vertex is found? In other words, can a visitor be used to cut the search tree? Sorry, if this is a newbie question. Thank you very much in advance for your help. Tobias