Assertion: graph's vertex | /r/HasProperty | marked
Facets:
value: during such a traversal
type: TEMPORAL
Source sentences:
text: Let every vertex be marked as unvisited.
text: For each vertex v in ascending DFS-numbers 1...n, traverse every backedge (i.e. every edge not in the DFS tree) that is incident to v and follow the path of tree-edges back to the root of T, stopping at the first vertex that is marked as visited.
text: During such a traversal, every traversed vertex is marked as visited.