Topological graph optimal path algorithm with constraint conditions

Abstract

Disclosed is a topological graph optimal path algorithm with constraint conditions, comprising: generating topological nodes with telecommunication devices and generating topological links with fibre connections, so as to form a topological matrix; selecting a source and a destination topological node; establishing, according to the constraint conditions, a list of topological nodes and topological links, which must be passed through, converting the topological links, which must be passed through, into topological nodes, which must be passed through, and adding same to the list of topological nodes which must be passed through; establishing, according to the constraint conditions, a list of topological nodes and topological links to be avoided, and updating the topological matrix; setting a start and an end topological node during the current path-searching to be Nt and Ne; when Nt is connected with the topological link L, adding Nt, Ne, and L to the overall path; otherwise, searching for the optimal path between Nt and Ne and adding same to the overall path; and if Ne is the destination topological node, then ending; otherwise, updating the topological matrix according to the optimal path between Nt and Ne, and starting the next iteration. The present invention realizes searching for the optimal path under constraint conditions, and improves the path-searching efficiency in the case of a large source topological node degree by improving the Dijkstra algorithm.