Skip to content

Glossary: Data Structures and Algorithms in Go

Visited set

Also written: visited, visited map

A `map[string]bool` of places a search has already reached, so none is handled twice. Without it, BFS would loop around a cycle forever.

Where the book teaches it

Related terms

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