使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构 使用最小堆来存储活结点，解空间树是一个子集树-Priority queue using branch and bound method of single-source shortest path problem solving, and the youngest heap as a priority queue to use the smallest heap storage structure to store