Shortest path algorithms. Priority queue implementations. Faster. I wouldn't have posted such as stdafx. Posted only core code. Yourself a clean compile on the line. I tested myself, 60,000 points. 20duowantiao, calculate the single-source shortest path took dozens of points to other points of m, while the adjacency list implementation methods are used to 3 hour