有向无环图的拓扑排序 用邻接矩阵保存图，边的输入采用三元组（求最短路径）和二元组（拓扑排序）。-DAG topological sort of the adjacency matrix with the preservation plan, while the use of triple input (for the shortest path) and the dual group (topological sort).