From: Christian Heller <c.heller@plomlompom.de>
Date: Sun, 6 Dec 2020 19:16:55 +0000 (+0100)
Subject: Record ideas for optimizing Dijkstra mapping.
X-Git-Url: https://plomlompom.com/repos/%7B%7Bdb.prefix%7D%7D/static/new_day?a=commitdiff_plain;h=0343bcfedc26a4f2938312f1573de36dfd0fd9be;p=plomrogue2

Record ideas for optimizing Dijkstra mapping.
---

diff --git a/plomrogue/mapping.py b/plomrogue/mapping.py
index 53e9d29..d4b19b1 100644
--- a/plomrogue/mapping.py
+++ b/plomrogue/mapping.py
@@ -257,6 +257,12 @@ class SourcedMap(Map):
 class DijkstraMap(SourcedMap):
 
     def __init__(self, *args, **kwargs):
+        # TODO: check potential optimizations:
+        # - do a first pass circling out from the center
+        # - somehow ignore tiles that have the lowest possible value (we can
+        #   compare with a precalculated map for given starting position)
+        # - check if Python offers more efficient data structures to use here
+        # - shorten radius to nearest possible target
         super().__init__(*args, **kwargs)
         self.terrain = [255] * self.size_i
         self[self.center] = 0