Boost Graph library-based K shortest path searching method and system

A shortest path and search method technology, applied in the field of computer networks, can solve problems such as gaps, differences, and direct application of immature and efficient computer methods, and achieve the effect of reducing workload, reducing time complexity and space complexity

Active Publication Date: 2012-06-27
CHINA ELECTRIC POWER RES INST +2
View PDF2 Cites 13 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, these methods are only a theoretical model, and there is still a certain gap with the actual application. U

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
  • Boost Graph library-based K shortest path searching method and system
  • Boost Graph library-based K shortest path searching method and system
  • Boost Graph library-based K shortest path searching method and system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0049] In order to make the purpose, technical solution and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings and examples.

[0050] Assume that the K shortest path problem is to calculate the top K shortest paths sorted from small to large by the number of path hops from point s to point t, and it is required that the shortest path is not limited by separation.

[0051] refer to figure 1 , for the K then shortest route computer algorithm process described in the present invention, in conjunction with above concrete problem analysis, obtain the concrete steps as follows:

[0052] Step 1: Define the set of top K short paths to be Kpaths.

[0053] Step 2: Call the BFS function of the Boost Graph library to calculate the shortest path from s→t;

[0054] Step 3: Since the shortest path is not limited by separation, go directly to step 4:

[0055] Step 4: Define the d-fork he...

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 provides a Boost Graph library-based K shortest path searching method and system. The Boost Graph library-based K shortest path searching method comprises the following steps of: expanding a K shortest path algorithm on the basis of a mature C++ Boost Graph library; optimally sequencing shortest paths to be selected by adopting a d-heap data structure; and developing multiple shortest routes by adopting an edge deviating manner. The Boost Graph library-based K shortest path searching method solves the practical difficulty in the k shortest path problem to a certain degree from the computer application angle, and the workload of practical design or development algorithm is greatly lightened. The Boost Graph library-based K shortest path searching system is a set of software and hardware system based on the method, integrates all invent contents of the method and can be directly used for searching the K shortest path before computation.

Description

technical field [0001] The invention belongs to the field of computer networks, and in particular relates to a method and system for searching the shortest path of K-law based on Boost library. Background technique [0002] In network planning or path search, it is often necessary to find new routes. Generally, this can be solved by the shortest path method in graph theory. Commonly used shortest path methods are classic methods such as breadth-first method and Dijkstra method. A common feature of these methods is to only find the shortest path from a given point to any point in the graph. But this is often not enough in practice. For example, in routing planning, in addition to the shortest path, it may be necessary to find the second shortest path as a backup. Under some conditions, it may be necessary to find the third, fourth shortest path or all path. Such problems are collectively referred to as the K shortest path problem or the K shortest path problem. [0003] T...

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
IPC IPC(8): H04L12/56H04L12/721
Inventor 卢利锋周静
Owner CHINA ELECTRIC POWER RES INST
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