The invention relates to a linear optimal shortest path search method. In the method, the shortest path distance between a marked temporary node and a source node and the linear distance between the temporary node and a target node are used as the basis for selecting a permanent marker node from a temporary node set under the conditions that a researched network can be seen as a planar network. The provided shortest path search method reduces the number of traversing nodes in search, thereby increasing the searching speed.