Skip to content

Glossary: Data Structures and Algorithms in C++

visited set

Also written: visited

The set of places a search has already reached, so none is handled twice. Without it BFS would loop forever around Roastery, Burnside, Hawthorne.

Where the book teaches it

Related terms

Breadth-first search (BFS)Depth-first search (DFS)