Assertion: graph's loop | /r/CapableOf | reach vertex
Facets:
Source sentences:
text: To find all the components of a graph, loop through its vertices, starting a new breadth first or depth first search whenever the loop reaches a vertex that has not already been included in a previously found component.