构造一个图，至少有四个结点，实现图的非递归深度优先遍历，存储、初始化也包括在内。-Construct a map, at least four nodes, to achieve non-recursive depth-first traversal, the memory, the initialization is also included.