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

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...

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. Unlike the shortest path method, there is no open-source mature and efficient computer method for direct application.

Images