Quick code review to refresh my memory.

pathing.cpp

@@ -14,9 +14,6 @@ inline void add_neighbors(PointList &neighbors, Matrix &closed, size_t y, size_t
   }
 }
 
-/*
- * Used https://github.com/HenrYxZ/dijkstra-map as a reference.
- */
 void Pathing::compute_paths(Matrix &walls) {
   INVARIANT();
   dbc::check(walls[0].size() == $width,
@@ -66,7 +63,6 @@ void Pathing::compute_paths(Matrix &walls) {
 }
 
 void Pathing::set_target(const Point &at, int value) {
-  // FUTURE: I'll eventually allow setting this to negatives for priority
   $input[at.y][at.x] = value;
 }