Assertion: graph's vertex | /r/HasProperty | visited
Facets:
value: more than
type: DEGREE
value: as infrequently as
type: TEMPORAL
Source sentences:
text: such that each vertex is visited exactly once is known as a Hamiltonian circuit.
text: Thus, it is usually necessary to remember which vertices have already been explored by the algorithm, so that vertices are revisited as infrequently as possible (or in the worst case, to prevent the traversal from continuing indefinitely).
text: Unlike tree traversal, graph traversal may require that some vertices be visited more than once, since it is not necessarily known before transitioning to a vertex that it has already been explored.
text: If the vertex has already been visited, it is ignored and the path is pursued no further; otherwise, the algorithm checks/updates the vertex and continues down its current path.
text: An important example of this is a tree: during a traversal it may be assumed that all "ancestor" vertices of the current vertex (and others depending on the algorithm) have already been visited.
text: When a new vertex is visited, then again all incident outgoing edges and the vertices at the end are known.
text: If vertex you are at has been visited, don't pursue this route again.
text: each vertex is visited once, whereas in B(2,4), each edge is traversed once.
text: each vertex is visited once, whereas in B(2,4), each edge is traversed once.
text: Therefore, we must keep track of the vertices that have been visited.
text: For simplicity, we assume that when a vertex is visited, its index is output.
text: Moreover, each vertex is visited only once.