对图的深度，广度遍历，关键路径算法，最短路径算法实现，求生成树的深度及叶子结点数-Depth, breadth traversal, critical path algorithm, the shortest path algorithm, find the depth of the spanning tree and leaf nodes