prepare (1/3): 
finished

make (2/3): 
g++ -g -Wall -O2 -o main.o -c main.cpp 
In file included from main.cpp:4:0:
unsorted_heap.h: In instantiation of 'TYPE unsorted_heap<TYPE, COMP>::dequeue_min() [with TYPE = point; COMP = compare_t]':
main.cpp:121:1:   required from here
unsorted_heap.h:70:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<this->size();i++){
In file included from main.cpp:5:0:
binary_heap.h: In instantiation of 'void binary_heap<TYPE, COMP>::percolateDown(int) [with TYPE = point; COMP = compare_t]':
main.cpp:121:1:   required from here
binary_heap.h:67:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(j=2*id;j<=this->size();j=2*id) {
binary_heap.h:68:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(j<this->size() && compare(data[j],data[j-1])) {  //heap[j]>heap[j+1]
In file included from main.cpp:3:0:
fib_heap.h: In instantiation of 'void fib_heap<TYPE, COMP>::Consolidate() [with TYPE = point; COMP = compare_t]':
fib_heap.h:273:11:   required from 'TYPE fib_heap<TYPE, COMP>::dequeue_min() [with TYPE = point; COMP = compare_t]'
main.cpp:121:1:   required from here
fib_heap.h:165:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < this->number; i++) A[i] = NULL;
                 ~~^~~~~~~~~~~~~~
fib_heap.h:180:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i=0; i<this->number; i++) {
               ~^~~~~~~~~~~~~
main.cpp: In function 'int main(int, char**)':
main.cpp:115:28: warning: 'PQ' may be used uninitialized in this function [-Wmaybe-uninitialized]
                 PQ->enqueue(*N);
                 ~~~~~~~~~~~^~~~
g++ -g -Wall -O2 -o main main.o
finished

clean (3/3): 
finished

all task finished, build successfully