1) minimum heap
最小堆
1.
This paper optimizes the Dijkstra algorithm by using the data structure of minimum heap, the optimized algorithm improves time complexity and space complexity compared with the classical Dijkstra algorithm.
采用最小堆对Dijkstra最短路径算法进行优化,优化后的算法比起经典算法在时间复杂度和空间复杂度上都有明显的提高。
2) binary minimum heap
二叉最小堆
1.
Hashtable was used to realize the storage structure of graph and binary minimum heap was used to realize the minimum priority queue.
以Hashtable类作为图的存储结构,使用二叉最小堆实现了最小优先队列,充分发挥MapOb-jects2组件和。
3) minimum height of stack
最小堆码高度
4) Small nuclear power
小堆
1.
Small nuclear power AIP technology applied in modern conventional submarine;
现代常规潜艇的小堆AIP技术
5) densest packing
最密堆积
6) optimum heatping up methods
最佳堆放
补充资料：最小辐亮度与最小辐照度(见核爆炸火球)
最小辐亮度与最小辐照度(见核爆炸火球)
minimum-brightness and minimum-irradiance
zuixiao fuliangdu yu zuixiaofu乙haodu最小辐亮度与最小辐照度(minimum-brightness and而nimum一irradianee)见核爆炸火球。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条