public int Insert(T item, float utility) { var hn = new HeapNode <T>(); hn.t = item; hn.key = utility; return(heap.insert(hn)); }
public int CompareTo(HeapNode <T> other) { return(key.CompareTo(other.key)); }