Description: 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
To Search:
File list (Check if you may need any files):
zuidatuan.cpp
Download