Files
marqdo/tests/applications/routes/consumer.py
T
cflmy 9331af78e2 release(2.8.0): 合入 CHANGELOG/README/发版说明/skills prove 任务;CI 链接指向 doc/releases
- CHANGELOG.md:v2.8.0 条目(中英双语);
- README.md:版本行 2.7.1→2.8.0 + 愿景第 6 条(知识可证明);
- doc/releases/v2.8.0.md:双语发版说明(亮点/用法/已知限制);
- skills/marqdo-dev/index.mq.md:新增 prove 任务(路径/目录模式/
  require_lean/json;参数用 + 行声明升参,check 与 narrative-ratio 通过);
- 设计文档 §12.5 标记已合入;发版链接统一指向 doc/releases/v2.8.0.md。
2026-11-18 10:29:26 +08:00

18 lines
654 B
Python
Executable File

import heapq
adjacency = {node: [] for node in bridge['nodes']}
for edge in bridge['edges']:
adjacency[edge['from']].append((edge['to'], edge['weight']))
distance = {bridge['source']: 0}
pending = [(0, bridge['source'])]
while pending:
cost, node = heapq.heappop(pending)
if distance[node] != cost:
continue
for target, weight in adjacency[node]:
candidate = cost + weight
if target not in distance or candidate < distance[target]:
distance[target] = candidate
heapq.heappush(pending, (candidate, target))
answer = [{'node': n, 'distance': distance.get(n)} for n in bridge['nodes']]
answer