求一项工程完成时的最短时间和路径以及关键路径。-Completion of a project seeking the shortest time and the path and critical path.

任务：实现Dijkstra算法 工程名：Project_ShortestPath 要求：实现Dijkstra算法，算法主体写在CGraph类中；要求是从command窗口中输入源节点编号，并在command窗口中输出从源节点到所有目的节点的最短路长及最短路。注：要输出整条路径，而不仅仅是前一跳，也不允许逆序输出。 -Task: Dijkstra' s algorithm to achieve the project name: Project_ShortestPath requ

单源点最短路径课程设计，有完整注释，初学者适用-Single-source shortest path curriculum design, the entire project

Static routing is very simple. Each node has a routing table where each entry has the destination and the next node. On receiving a packet, a node find the entry corresponding to the packet s destination, and forwards it to the next node. If there is