An Optimal Path Algorithm for Topological Graphs with Constraints

Abstract

The invention discloses an optimal path algorithm of a topological graph with constraints, which includes generating topological nodes by telecommunication equipment and topological links by optical fiber connections to form a topological matrix; selecting source and sink topological nodes; and establishing the necessary topology according to the constraints List of nodes and topological links, and convert the necessary topological links into necessary topological nodes and add them to the list of necessary topological nodes; establish a list of avoiding topological nodes and topological links according to constraints, and update the topology matrix; set the current The starting and ending topological nodes of pathfinding are Nt and Ne; when Nt is connected to the topological link L <t，e>, the Nt, Ne and L <t，e>Add the overall path, otherwise find the optimal path between Nt and Ne and add it to the overall path; if Ne is the sink topology node, end, otherwise update the topology matrix according to the optimal path between Nt and Ne, and start the next iteration. The invention realizes finding the optimal path under constraint conditions, and improves the path-finding efficiency when the degree of the source topological node is large by improving the Dijkstra algorithm.< / t，e>

Description

technical field [0001] The invention relates to an optimal path algorithm of a topological graph, in particular to an optimal path algorithm of a topological graph with constraints. Background technique [0002] In the telecommunications transmission network, the telecommunications equipment is the communication node of the network, the optical fiber connects two telecommunications equipments as the communication channel, and many telecommunications equipments are connected to form the entire communication network. [0003] In engineering, when configuring the telecommunication transmission network circuit, it is necessary to find the optimal path from one telecommunication equipment to another telecommunication equipment through the designated telecommunication equipment and optical fiber. In order to solve the problem conveniently, the telecommunication transmission network is abstracted into the form of a topological graph, the telecommunication equipment is used as the t...

AI Technical Summary

Problems solved by technology

[0005] (1) The constraints of the optimal path cannot be specified, that is, the topological nodes and topological links that the optimal path must pass through cannot be specified, and the topological nodes and topological links that the optimal path avoids cannot be specified;

[0006] (2) There is no guarantee that the optimal path will not repeatedly pass through a certain topological node or topological link;

[0007] (3) Define the degree of a topological node as the number of topological links connected to the topological node. When the degree of the source topological node is large, the time to find the optimal path increases significantly, which cannot meet the time requirements of engineering applications

Images