-
Committer:
Marcos Andrés Acosta Feliciano
-
Date:
2020-07-07 05:55:17 UTC
-
Revision ID:
tinglar@tutanota.com-20200707055517-owzcpuqh20madlcm
🔥 Remove Dijkstra's algorithm
I decided that, because there are no weighted edges in the maze
(that is, the paths between any two adjacent floor tiles have no
special properties that distinguish one such path from another),
Dijkstra's algorithm would be too big a solution.