Below is the Pseudocode of the DFS. In the init() function, we run the DFS function on every node because most of the times, a graph may contain two different disconnect part. So it makes sure that we ...

Running the tester version uses the text file, test_puzzles.txt, and runs each puzzle in the file against BFS, DFS, and Dijkstra's algorithm then prints the minimum cost and number of moves for each.