给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。

功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the relevant results. Functional requirements: the basic information input graph, and the establishment of graph storage structure (with the appropriate prompt), the output traversal sequences, then the topological sort and test the plan is to have directed acyclic graph, and the output sequence topology