This module contains the functions of the various scans and their auxiliary functions. The scan functions run tests and traverse the graph according to some inherent logic. Currently present are random-dfs/soft-dfs (soft-dfs is random-dfs without randomising groups), Best-First-Search (named A* in the code) and Breadth-First-Search (named BFS in the code) functions.