fix: Add type annotations for queue, distance, previous, and path in DijkstraPathPlanning

Author: shima004

adf_core_python/implement/module/algorithm/dijkstra_path_planning.py

@@ -1,6 +1,7 @@
 from __future__ import annotations
 
 import heapq
+from typing import Optional
 
 from rcrs_core.entities.area import Area
 from rcrs_core.worldmodel.entityID import EntityID
@@ -49,10 +50,10 @@ def get_path(
         self, from_entity_id: EntityID, to_entity_id: EntityID
     ) -> list[EntityID]:
         # ダイクストラ法で最短経路を計算
-        queue = []
+        queue: list[tuple[float, EntityID]] = []
         heapq.heappush(queue, (0, from_entity_id))
-        distance = {from_entity_id: 0}
-        previous = {from_entity_id: None}
+        distance: dict[EntityID, float] = {from_entity_id: 0}
+        previous: dict[EntityID, Optional[EntityID]] = {from_entity_id: None}
 
         while queue:
             current_distance, current_node = heapq.heappop(queue)
@@ -70,7 +71,7 @@ def get_path(
                     heapq.heappush(queue, (new_distance, neighbor))
                     previous[neighbor] = current_node
 
-        path = []
+        path: list[EntityID] = []
         current_node = to_entity_id
         while current_node is not None:
             path.append(current_node)