The graph scan algorithm traverses all reachable nodes in a graph. Its behaviour can be changed by plugging in different datastructures: Using an unordered set results in a random search, using a stack yields depth-first search, and using a queue gives breadth-first search.
- v1.0: Initial version
- v1.1: Fix a mistake in the bottom BROAD SEARCH example
- v1.2: Change title from GRÅPH SCÄN to GRÅPH SKÄN to make it sound even more Swedish
- v1.3: Update the IDEA logo
Initially published 2017-11-29.