Skip to content

Glossary: Data Structures and Algorithms in Rust

visited set

Also written: visited

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

Where the book teaches it

Related terms

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