Traversal search method and device for routes

Abstract

The invention discloses a traversal search method and device for routes. The method comprises steps as follows: searching a first route associated with a starting point and a second route associated with a terminating point; comparing a tail node of the first route associated with the starting point and a tail node of the second route associated with the terminating point; when the tail node of the first route associated with the starting point is identical with the tail node of the second route associated with the terminating point, combining the first route associated with the starting point and the second route associated with the terminating point to form a route from the starting point to the terminating point.

Description

technical field [0001] The invention relates to the technical field of network management, in particular to a route traversal search method and device. Background technique [0002] When a communication operator opens a dedicated line service for an industry customer, it needs to allocate a fiber optic path for the customer, and realize the customer's point-to-point information communication through the fiber. In the deployment process of the optical fiber channel, it is necessary to traverse and search all the routes according to the type of optical fiber, the necessary points, and the depth of the path, and the professional network management personnel of the operator shall select one of them. The current traversal search method for the optical path route starts from a single point and traverses all routes through a breadth-first or depth-first algorithm. [0003] The existing scheme is mainly to construct the undirected graph formed by the abstraction of the optical cabl...

AI Technical Summary

Problems solved by technology

[0004] In order to solve the technical problems of slow route search speed and low performance in the prior art, the present invention proposes a route traversal search method and device

Images