Linear optimal shortest path search method

A shortest path and path technology, applied in the shortest path search field of linear optimization, can solve the problem of not considering the direction or position of the target node, and achieve the effect of reducing the number of nodes and improving the speed.
CN101447947AActive Publication Date: 2009-06-03BEIJING RES CENT FOR INFORMATION TECH & AGRI
0 Cites 8 Cited by

Patent Information

Authority / Receiving Office
CN · China
Current Assignee / Owner
BEIJING RES CENT FOR INFORMATION TECH & AGRI
Publication Date
2009-06-03

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

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.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the field of path search, in particular to a straight line optimization shortest path search method. Background technique

[0002] The most famous solution of the shortest path method is the Dijkstra search method. The original Dijkstra search method divides network nodes into three types: unmarked nodes, temporary marked nodes and permanent marked nodes. All nodes in the network are first initialized as unmarked nodes, and the nodes connected to the shortest path nodes during the search process are temporary marked nodes, and each cycle searches for the path length from the source point from the temporary marked nodes The shortest node is used as a permanent marker node, and the search process is not ended until the target node is found or all nodes become permanent marker nodes.

[0003] In the original Dijkstra search process, since the temporary marked nodes are stored out of order, all temporary marked nodes must be trav...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More