Introduction - If you have any usage issues, please Google them yourself
Figure adjacency list is stored to write a depth-first search algorithm non-recursive form of
Adjacency list stored in the diagram using non-recursive depth-first search
The program is only suitable for a graph to a connected graph, with adjacency list for testing