ros/hrteam_planner/include/hrteam_planner/IPQ.h
//to get the min item the first element is exchanged with the lowest
//in the heap and then the heap is reordered from the top down. 
to get the min item the first element is exchanged with the lowest
in the heap and then the heap is reordered from the top down.
to get the min item the first element is exchanged with the lowest in the heap and then the heap is reordered from the top down .
int Pop() {
	Swap(1, m_iSize);
	ReorderDownwards(1, m_iSize-1);
	return m_Heap[m_iSize--];
      }
int Pop ( ) { Swap ( 1 , m_iSize ) ; ReorderDownwards ( 1 , m_iSize - 1 ) ; return m_Heap [ m_iSize -- ] ; }
to get the min item the first element is exchanged with the lowest
in the heap and then the heap is reordered from the top down.
to get the min item the first element is exchanged with the lowest in the heap and then the heap is reordered from the top down .