（1）键盘输入数据，建立一个有向图的邻接表，并输出该邻接表。

（2）在有向图的邻接表的基础上计算各顶点的度，并输出。

（3）以有向图的邻接表为基础实现并输出它的拓扑排序序列。

（4）在主函数中设计一个简单的菜单，分别调试上述算法。

-(1) keyboard input data, the establishment of a directed graph adjacency list and outputs the adjacent table.

       　(2) When computing the degree of each vertex adjacent to the base map on the table, and output.

(3) In a directed graph adjacency list basis to achieve and output of its topological sorting sequence.

(4) design a simple menu in the main function, namely debug the algorithm described above.