public int insert(IMarchingNode key) { WrapperINode Key = new WrapperINode(key); int ID = Heap.insert(Key); return(ID); }
public void decreaseKey(int ID, IMarchingNode key) { WrapperINode Key = new WrapperINode(key); Heap.decreaseKey(ID, Key); }
public IMarchingNode findMinimum(IMarchingNode key) { WrapperINode Key = new WrapperINode(key); return(Heap.findMinimum(Key).ToNode()); }
public void changeKey(int ID, IMarchingNode key) { WrapperINode Key = new WrapperINode(key); Heap.changeKey(ID, Key); }