Commit c7583795 authored by Cody A Burchett's avatar Cody A Burchett

-m additional comment

parent 7b5d33f0
...@@ -8,6 +8,8 @@ public class Heap <Tile> where Tile : HeapItem<Tile>{ ...@@ -8,6 +8,8 @@ public class Heap <Tile> where Tile : HeapItem<Tile>{
Tile[] heapTiles; Tile[] heapTiles;
int itemCount; int itemCount;
//replace openList with Heap
//add heapIndex, compareTo to tile class //add heapIndex, compareTo to tile class
//compare fCost of node then hCost //compare fCost of node then hCost
//item.compareTo(item2) should return pos if item is less than item2, neg if item is greater than item2 //item.compareTo(item2) should return pos if item is less than item2, neg if item is greater than item2
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment