以邻接矩阵的方式确定有向网，完成：

A．建立并显示出它的邻接链表；

B．以非递归方式进行深度优先遍历，显示遍历的结果，（并随时显示栈的入出情况）；

C．对该图进行拓补排序，显示拓补排序的结果，并随时显示入度域的变化情况；

D．给出某一确定顶点到所有其他顶点的最短路径-Adjacency matrix to determine a directed network, the completion of: A. To establish and demonstrate its adjacency list　B. Non-recursive approach to depth-first traversal, display the results of traversal, (and to keep out of the situation into the show stack)　C. Sort of the graph topology, showing topology sort results and shows changes over time into the degree of changes in the domain　D. Given a vertex to all other vertices to determine the shortest path