Binary chop tracking method of shortest paths in network map

A shortest path, binary search technology, applied in special data processing applications, instruments, electrical digital data processing, etc.

Inactive Publication Date: 2010-07-28
ANHUI UNIVERSITY
View PDF0 Cites 31 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0013] The purpose of the present invention is to propose a binary search and tracking method for the shortest path in a network graph, to solve the problem of rapid extraction of the later path of the shortest path algorithm in the network graph, and to find out the shortest path between any two nodes

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
  • Binary chop tracking method of shortest paths in network map
  • Binary chop tracking method of shortest paths in network map
  • Binary chop tracking method of shortest paths in network map

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0054] Embodiment 1: extracting the shortest path of the unprivileged network of routers in the computer network

[0055] In the computer network, the network is established at the router level, the nodes are routers, and the edges are physical connections (such as optical fibers) between routers. Likewise, at the level of autonomous systems, nodes are domains and edges are the physical links connecting domains.

[0056] Select a router-level network on the Internet in a certain area, and label each router in sequence. The connection status of each router is represented by an unauthorized edge connection. No connection is 0, and connection is 1, and the quotient space coverage model is established. In this embodiment, for an undirected and unweighted network, there are 5 nodes marked as X{1, 2, 3, 4, 5, 6, 7, 8}, and its edge set E: node 1 to node 2, node 1 to node 3, node 2 to node 3, node 2 to node 4, node 3 to node 5, node 4 to node 6, node 5 to node 6, node 5 to node 7, n...

Embodiment 2

[0096] Example 2: Extracting the shortest path of the weighted network in the road grid

[0097] For the road traffic network, the nodes are place names with intersections, and the edges are roads. In the railway transportation network, the nodes are railway stations and the edges are railways. Similarly, in the aviation network, the airport is used as a node, and the edges are flights.

[0098] The following is an example of a road network.

[0099] According to China's "Technical Standards for Highway Engineering", roads are divided into five grades, and urban roads are divided into four categories: express roads, trunk roads, secondary trunk roads and branch roads. A specific urban road section usually includes multiple types of highways, streets, roads, alleys, and roads. In cities, urban and rural areas, and between towns, road sections include expressways, national roads, provincial roads, and township roads, and roads include 4-lane, 3-lane, 2-lane, and single-lane r...

Embodiment 3

[0112] Example 3: Extracting the shortest path in the power system network

[0113] According to the voltage of long-distance power transmission in my country, there are 110 kV, 220 kV, and 330 kV. In the actual situation, a directed weighted network is established for the power transmission process of the power system. The nodes are each distribution transformer, step-up and step-down, and the weights on the sides are determined according to the transmission voltage, total length and transmission power of the transmission line It is determined that the less power loss in the transmission process, the smaller the weight on its edge.

[0114] Select the power transmission system in a certain area, and label each distribution transformer, step-up and step-down in sequence, and the connection status of each distribution transformer, step-up and step-down is represented by a weighted directed edge. The weight of the connection is 0, and other weights are determined according to the...

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 invention discloses a binary chop tracking method of shortest paths in a network map, which is characterized in that the method comprises the following steps: extracting the step number of the shortest paths from a source node to a gathered node according to a shortest path step number matrix; reducing and separating the step number by half into the front step number and the back step number; searching nodes with the step number equal to the front step number in a source node row vector of the shortest path step number matrix, using the nodes as a front step number node set, searching nodes with the step number equal to the back step number in a gathered node column vector of the shortest path step number matrix, using the nodes as a back step number node set; taking an intersection set of the front step number node set and the back step number node set as middle nodes; using each node in the intersection as the reference; using the method for solving the middle node of the source node and the node, and the middle node of the node and the gathered node until the shortest path step number between the solved nodes is 1; and sequentially inserting the middle nodes into corresponding positions to obtain all shortest paths from the source node to the gathered node. The method of the invention is used for finding all shortest paths between two points, and the invention can provide various schemes for the preferential path selection of the network map abstracted from actual data.

Description

technical field [0001] The invention belongs to the technical field of path search using a network graph, and in particular relates to a binary search and tracking method for the shortest path in the network graph. Background technique [0002] With the development of information technology, network graph data processing technology has also been developed rapidly. In order to facilitate data processing, specific practical problems are often abstractly modeled as network graph structures, such as computer networks, road grids, power system networks, and logistics transportation networks. Path optimization in network diagrams is a common problem, such as computer network routing selection, geographic information system traffic road routing selection, power system routing planning, logistics transportation route selection, etc., according to "Operational Research Methods and Models" (Fudan University Publishing House, edited by Fu Jialiang, January 2006, pages 216-228), this i...

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): G06F17/30
Inventor 何富贵赵姝陈洁张铃张燕平
Owner ANHUI UNIVERSITY
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