int HeapNode::operator <(FibHeapNode& RHS)
{
int X;
if ((X=FHN_Cmp(RHS)) != 0)
return X < 0 ? 1 : 0;
return N < ((HeapNode&) RHS).N ? 1 : 0;
};
int FibHeapNode::operator <(FibHeapNode& RHS)
{
int X;
if ((X=FHN_Cmp(RHS)) != 0)
return X < 0 ? 1 : 0;
// Key compare goes here in derived classes
return 0;
}
int node::operator <(FibHeapNode& RHS)
{
int X;
if ((X=FHN_Cmp(RHS)) != 0)
return X < 0 ? 1 : 0;
return total_cost < ((node&) RHS).total_cost ? 1 : 0;
};
int HeapNode::operator ==(FibHeapNode& RHS) {
if (FHN_Cmp(RHS)) return 0;
return N == ((HeapNode&) RHS).N ? 1 : 0;
}
int FibHeapNode::operator ==(FibHeapNode& RHS)
{
if (FHN_Cmp(RHS)) return 0;
// Key compare goes here in derived classes
return 1;
}
int node::operator ==(FibHeapNode& RHS)
{
if (FHN_Cmp(RHS)) return 0;
return total_cost == ((node&) RHS).total_cost ? 1 : 0;
}
