docs: def get_path(self, x: int, y: int) -> List[Tuple[int, int]]:
          """Return a list of (x, y) steps to reach the goal point, if possible.
          """
          lib.TCOD_dijkstra_path_set(self._path_c, x, y)
          path = []
          pointer_x = ffi.new("int[2]")
          pointer_y = pointer_x + 1
          while lib.TCOD_dijkstra_path_walk(self._path_c, pointer_x, pointer_y):
              path.append((pointer_x[0], pointer_y[0]))
          return path