With the dijkstra algorithm for path planning, the data quantity is large, probably more than 10000 nodes, the adjacency matrix is very big, run time will be longer, is there any optimization method, or other can do path planning algorithm to solve the problem? Please give directions