Introduction - If you have any usage issues, please Google them yourself
Single-source shortest path problem, branch and bound method of the priority queue method, the smallest heap to store slipknot points table, said slipknot point priority queue, priority is the node corresponding to the current path length