Method for searching for shortest path between two points in improved Dijkstra algorithm

A technology of shortest path and search method, applied in the direction of digital transmission system, electrical components, transmission system, etc., can solve the problems of reducing the amount of calculation and short search path, etc.

Active Publication Date: 2017-10-20
BEIJING JIAOTONG UNIV
View PDF5 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0024] The present invention aims to overcome the deficiencies of the existing Dijkstra algorithm, and provides an improved Dijkstra algorithm search method for the shortest path between two points, and path analysis based on the adjacency matrix avoids the useless calculation process of disconnected nodes , which effectively reduces the amount of calculation and ensures the shortest search path, which can not only accurately determine the shortest path and distance, but also improve the calculation speed

Method used

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
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for searching for shortest path between two points in improved Dijkstra algorithm
  • Method for searching for shortest path between two points in improved Dijkstra algorithm
  • Method for searching for shortest path between two points in improved Dijkstra algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0041] The embodiments of the present invention will be described below with reference to the drawings. Those of ordinary skill in the art may realize that the described embodiments can be modified in various different ways or combinations thereof without departing from the spirit and scope of the present invention. Therefore, the drawings and descriptions are illustrative in nature and are not used to limit the scope of protection of the claims. In addition, in this specification, the drawings are not drawn to scale, and the same reference numerals denote the same parts.

[0042] Combine below figure 1 This embodiment will be described in detail. Hereinafter, the application of the method proposed by the present invention is applied to the topology diagram of the network shown in the figure to illustrate the application of the method.

[0043] Graph theory is a branch of mathematics. It uses graphs as the research object to study the mathematical theories and methods of graphs ...

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

PUM

No PUM Login to view more

Abstract

The present invention provides a method for searching for the shortest path between two points in the improved Dijkstra algorithm, comprising the following steps: 1) introducing an adjacency matrix in the graph theory and assisting the search process by using an adjacency matrix, that is, after determining the shortest distance from one vertex to the starting vertex each time, finding a column wherein the row element is 1 corresponding to the vertex in the adjacency matrix; and 2) calculating and analyzing only the vertex distance value corresponding to the column with the element 1 in step 1), and effectively reducing the calculation amount of the search process. The method for path analysis based on the adjacency matrix avoids useless calculation processes of disjoint nodes, effectively reduces the amount of computation, and ensures the shortest search path.

Description

Technical field [0001] The invention relates to the fields of power system networks, road traffic, communication networks and the like, and in particular to a method for searching the shortest path between two points by improving the Dijkstra algorithm. Background technique [0002] Finding the shortest path between any two points is the basis of all path problems. The goal of the problem is to find the shortest path between any two vertices in the graph. It has a wide range of uses in power system networks, road traffic, and communication network optimization. [0003] For the shortest path calculation problem between two points, the main international method used is the Dijkstra algorithm (Dijkstra algorithm), which can find the shortest path from one point to the other points in the network. The Dijkstra algorithm was proposed by the Dutch computer scientist Dijkstra in 1959, so it is also called the Dijkstra algorithm. It is the shortest path algorithm from one vertex to the ...

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

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04L12/721
CPCH04L45/12H04L45/123
Inventor 和敬涵王紫琪张大海李文立丁凡凡张秋芳张义志任欣玉
Owner BEIJING JIAOTONG UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap