文件名称:zuidatuan
介绍说明－－下载内容均来自于网络，请自行研究使用
使用优先队列分支限界法对单源最短路径问题求解，最小堆作为优先队列的存储结构
使用最小堆来存储活结点，解空间树是一个子集树-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 slipknot, the solution space tree is a subset of the tree
使用最小堆来存储活结点，解空间树是一个子集树-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 slipknot, the solution space tree is a subset of the tree
相关搜索： 分支限界法
(系统自动生成,下载前可以参看下载内容)
下载文件列表
zuidatuan.cpp