Assertion: algorithm | /r/CapableOf | start new tree
Facets:
value: in f
type: LOCATION
value: automatically
type: MANNER
Source sentences:
text: As described above, the starting vertex for the algorithm will be chosen arbitrarily, because the first iteration of the main loop of the algorithm will have a set of vertices in Q that all have equal weights, and the algorithm will automatically start a new tree in F when it completes a spanning tree of each connected component of the input graph.