Minor update.

Author: xzripper

AStarD/AStar.d

@@ -1,4 +1,4 @@
-// A* (A-Star) search algorithm for 2D grids by Évan (xzripper): https://github.com/xzripper/AStarD
+// A* (A-Star) search algorithm for 2D grids by Evan (xzripper): https://github.com/xzripper/AStarD
 
 module AStarD.AStar;
 
@@ -48,6 +48,8 @@ ASPath AStar(
     Heuristic p_Heuristic,
     bool p_AllowDiagonalMovement ) @safe
 {
+    if ( p_Grid.length <= 1 ) { return []; }
+
     Heap!Node t_NodesHeap = Heap!Node( HeapType.MIN_HEAP );
 
     t_NodesHeap.HeapPush( [0, p_Start[0], p_Start[1]] );

AStarD/DHeap/Heap.d

@@ -7,7 +7,7 @@
  * It is iterable and optimized to avoid useless allocations of memory.
  * Uses safe code and minimizes reliance on the garbage collector.
  *
- * https://github.com/xzripper/DHeap by Évan
+ * https://github.com/xzripper/DHeap by Evan
 */
 
 module DHeap.Heap;
@@ -111,7 +111,7 @@ struct Heap(T)
         return (m_HeapType == HeapType.MIN_HEAP) ? p_Object0 < p_Object1 : p_Object0 > p_Object1;
     }
 
-    T HeapFront() const @property @safe @nogc
+    T HeapFront() @property @safe @nogc
     {
         return m_HeapData[0];
     }