The importance evaluation of nodes is an important part of traffic network analysis. To avoid targeted assaults and resolve path planning issues in complicated traffic networks, it is advantageous to choose and evaluate important path nodes. This has important practical significance. In this study, we propose a method based on the K-shell algorithm for finding important nodes in a rescue path using the shortest rescue path with the provided starting and ending points. Firstly, a complex network is built using the original data of the road network, and the initial shortest path is solved on the basis of the starting and ending points. Then, Ks values of all nodes on the shortest path are calculated and the nodes are arranged hierarchically. Next, the shortest path is replanned by deleting some important nodes, which is followed by analyzing and comparing the change in the length of the updated shortest path. Finally, the above operations are performed in turn, and the important nodes in the process of planning the rescue path are screened out. To assess the rationality of the selection of important nodes, the degree D of the node and the quantity N of nodes in the two-step neighborhood of each important node are chosen. The experimental results show that the proposed method can quickly and effectively identify the important nodes that need key protection when planning rescue paths.