在网络通信中，经常需要求最短路径。但完全采用最短路径传输有这样一个问题：如果最终在两个终端节点之间给出的最短路径只有一条，则在该路径中的任一个节点或链路出现故障时，信号传输将面临中断的危险。因此，对网络路由选择作了以下改进：为任意两节点之间通信提供两条路径供其选择，即第一最短路径、第二最短路径.使用数据结构编程实现，程序=算法+数据结构的很好体现-In network communication, often request the shortest path. But totally shortest path transmission has a problem: If the shortest path between two terminal nodes eventually given only one, then any one node or link in the path fails, the signal transmission will face disruption danger. Therefore, the network routing made the following improvements: two paths for their choice of any communication between two nodes, namely the shortest path first, second shortest path using the data structure programming, program = algorithm+ data structure. the well reflected