weiwei0802的博客

利用最小堆 进行迷宫搜索 class CMinHeap { public: CMinHeap(int nSize) { m_pHeap = new tagPosition[nSize+1]; m_nLast = 0; } void Push(const tagPosition& x) { int i = ++m_nLast; while(i!=1 && x.value<m_pHeap[i/2].value) { m_pHeap[i] = m_pHeap[i/2]; i /= 2; } m_pHeap[i] = x; } void Pop(tagPosition& x) { x = m_pHeap[1]; tagPosition y = m_pHeap[m_nLast--]; int i=1, ci=2; while (ci <= m_nLast)