[graph-tool] has_path Equivalence

Hello, I was wondering if there's a equivalent to NetworkX's has_path function. I'd like to check if there is a path between two given vertexes, and if there is, then return True. This can be done in NetworkX with has_path. I think this is doable in graph-tool with StopSearch method, but I couldn't figure out a way to implement it. Any help is appreciated. Thanks.