py-11-dijkstra

[
  {
    "total": 1,
    "answer": "```python\nimport heapq\nfrom typing import Dict, List, Tuple\n\ndef dijkstra(graph: Dict[str, List[Tuple[str, float]], start: str) -> Dict[str, float]:\n    # Initialize the priority queue with the start node and distance 0\n    queue = [(0, start)]\n    distances = {start: 0.0}\n    \n    while queue:\n        # Pop the node with the smallest distance\n        current_distance, current_node = heapq.heappop(queue)\n        \n        # Skip processing if we've already found a shorter path\n        if current_distance > distances[current_node]:\n            continue\n        \n        # Explore neighbors\n        for neighbor, weight in graph.get(current_node, []):\n            distance = current_distance + weight\n            \n            # Update the distance if it's shorter\n            if neighbor not in distances or distance < distances[neighbor]:\n                distances[neighbor] = distance\n                heapq.heappush(queue, (distance, neighbor))\n    \n    # Return the distances, excluding unreachable nodes\n    return {node: dist for node, dist in distances.items() if dist < float('inf')}\n```",
    "passed": 0,
    "test_error": "==================================== ERRORS ====================================\n______________________ ERROR collecting test_dijkstra.py _______________________\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/python.py:508: in importtestmodule\n    mod = import_path(\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/pathlib.py:596: in import_path\n    importlib.import_module(module_name)\n/home/psc/miniconda3/lib/python3.12/importlib/__init__.py:90: in import_module\n    return _bootstrap._gcd_import(name[level:], package, level)\n           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n<frozen importlib._bootstrap>:1387: in _gcd_import\n    ???\n<frozen importlib._bootstrap>:1360: in _find_and_load\n    ???\n<frozen importlib._bootstrap>:1331: in _find_and_load_unlocked\n    ???\n<frozen importlib._bootstrap>:935: in _load_unlocked\n    ???\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/assertion/rewrite.py:188: in exec_module\n    exec(co, module.__dict__)\ntest_dijkstra.py:5: in <module>\n    from solution import dijkstra\nE     File \"/tmp/llmlab-py-11-dijkstra-uqhn9qo6/solution.py\", line 4\nE       def dijkstra(graph: Dict[str, List[Tuple[str, float]], start: str) -> Dict[str, float]:\nE                                                                        ^\nE   SyntaxError: closing parenthesis ')' does not match opening parenthesis '['\n=========================== short test summary info ============================\nERROR test_dijkstra.py\n!!!!!!!!!!!!!!!!!!!! Interrupted: 1 error during collection !!!!!!!!!!!!!!!!!!!!\n1 error in 0.05s"
  },
  {
    "total": 1,
    "answer": "```python\nimport heapq\nfrom typing import Dict, List, Tuple\n\ndef dijkstra(graph: Dict[str, List[Tuple[str, float]], start: str) -> Dict[str, float]:\n    # Initialize the priority queue with the start node and distance 0\n    queue = [(0, start)]\n    distances = {start: 0.0}\n    \n    while queue:\n        # Pop the node with the smallest distance\n        current_distance, current_node = heapq.heappop(queue)\n        \n        # Skip processing if we've already found a shorter path\n        if current_distance > distances[current_node]:\n            continue\n        \n        # Explore neighbors\n        for neighbor, weight in graph.get(current_node, []):\n            distance = current_distance + weight\n            \n            # Update the distance if it's shorter\n            if neighbor not in distances or distance < distances[neighbor]:\n                distances[neighbor] = distance\n                heapq.heappush(queue, (distance, neighbor))\n    \n    # Return the distances, excluding unreachable nodes\n    return {node: dist for node, dist in distances.items() if dist < float('inf')}\n```",
    "passed": 0,
    "test_error": "==================================== ERRORS ====================================\n______________________ ERROR collecting test_dijkstra.py _______________________\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/python.py:508: in importtestmodule\n    mod = import_path(\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/pathlib.py:596: in import_path\n    importlib.import_module(module_name)\n/home/psc/miniconda3/lib/python3.12/importlib/__init__.py:90: in import_module\n    return _bootstrap._gcd_import(name[level:], package, level)\n           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^\n<frozen importlib._bootstrap>:1387: in _gcd_import\n    ???\n<frozen importlib._bootstrap>:1360: in _find_and_load\n    ???\n<frozen importlib._bootstrap>:1331: in _find_and_load_unlocked\n    ???\n<frozen importlib._bootstrap>:935: in _load_unlocked\n    ???\n/home/psc/miniconda3/lib/python3.12/site-packages/_pytest/assertion/rewrite.py:188: in exec_module\n    exec(co, module.__dict__)\ntest_dijkstra.py:5: in <module>\n    from solution import dijkstra\nE     File \"/tmp/llmlab-py-11-dijkstra-m4i2ung9/solution.py\", line 4\nE       def dijkstra(graph: Dict[str, List[Tuple[str, float]], start: str) -> Dict[str, float]:\nE                                                                        ^\nE   SyntaxError: closing parenthesis ')' does not match opening parenthesis '['\n=========================== short test summary info ============================\nERROR test_dijkstra.py\n!!!!!!!!!!!!!!!!!!!! Interrupted: 1 error during collection !!!!!!!!!!!!!!!!!!!!\n1 error in 0.05s"
  },
  {
    "total": 1,
    "answer": "```python\nimport heapq\nfrom typing import Dict, List, Tuple\n\ndef dijkstra(graph: Dict[str, List[Tuple[str, float]], start: str) -> Dict[str, float]:\n    # Initialize the priority queue with the start node and distance 0\n    queue = [(0, start)]\n    distances = {start: 0.0}\n    \n    while queue:\n        # Pop the node with the smallest distance\n        current_distance, current_node = heapq.heappop(queue)\n        \n        # Skip processing if we've already found a shorter path\n        if current_distance > distances[current_node]:\n            continue\n        \n        # Explore neighbors\n        for neighbor, weight in graph.get(current_node, []):\n            distance = current_distance + weight\n            \n            # Update the distance if it's shorter\n            if neighbor not in distances or distance < distances[neighbor]:\n                distances[neighbor] = distance\n                heapq.heappush(queue, (distance, neighbor))\n    \n    # Return the distances, excluding unreachable nodes\n    return {node: dist for node, dist in distances.items() if dist < float('inf')}\n```",
    "passed": 0,
    "test_error": ""
  }
]

You are an expert programmer. Solve the task exactly as specified. Output your solution as fenced code blocks using the required file name(s) and the exact function/type signatures requested. Prefer correctness; do not include prose outside code unless asked.