对任意给定的图（顶点数和边数自定），建立它的邻接表并输出，然后利用堆栈的五种基本运算（清空堆栈、压栈、弹出、取栈顶元素、判栈空）实现图的深度优先搜索遍历和广度优先搜索遍历算法。

-For any given graph (vertices and edges from the set), to establish its adjacency list and output, and then use the stack of five basic operations (empty stack, push, pop, take the top element, sub-stack is empty ) to achieve depth-first search graph traversal and breadth-first search traversal algorithm.