Skip to content

Commit 566f1d8

Browse files
Generate community share previews [skip ci]
1 parent 32470c2 commit 566f1d8

2 files changed

Lines changed: 1 addition & 1 deletion

File tree

-4 Bytes
Loading

s/scr_mqeozl32_f0e2d3ed67cc89d7/index.html

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -28,7 +28,7 @@
2828
<link rel="icon" href="/assets/brand-mark.svg" type="image/svg+xml">
2929
<link rel="stylesheet" href="/assets/share-page.css?v=20260716-unified-work-card-2">
3030
<title>dijkstra算法 · Python IDE</title>
31-
<script id="initial-script-data" type="application/json">{"script_id":"scr_mqeozl32_f0e2d3ed67cc89d7","title":"dijkstra算法","summary":"迪克斯特算法","category":"python","file_type":"py","author_id":"usr_a8a4aabf642ab69248d3c6c00268","author_name":"楼顶的彦祖","author_avatar_id":"avatar_0868","author_premium_status":"lifetime","author_donation_level":"","status":"active","created_at":"2026-06-15T01:31:16.135Z","updated_at":"2026-06-15T04:07:28.382Z","approved_at":"2026-06-15T04:07:28.382Z","view_count":127,"run_count":81,"download_count":2,"like_count":1,"dislike_count":0,"score":1,"color_seed":"python","ai_summary":"这是一个 Dijkstra 最短路径算法工具,用于计算图中从起点到所有节点的最短距离和路径。","ai_usage_hint":"运行后选择手动输入矩阵或使用预设示例体验算法。","ai_analysis_source":"ai","ai_analysis_model":"deepseek-chat","ai_analysis_at":"2026-06-15T04:07:28.384Z","tags":["python","py"],"ai_tags":["最短路径","图算法","教学工具"]}</script>
31+
<script id="initial-script-data" type="application/json">{"script_id":"scr_mqeozl32_f0e2d3ed67cc89d7","title":"dijkstra算法","summary":"迪克斯特算法","category":"python","file_type":"py","author_id":"usr_a8a4aabf642ab69248d3c6c00268","author_name":"楼顶的彦祖","author_avatar_id":"avatar_0868","author_premium_status":"lifetime","author_donation_level":"","status":"active","created_at":"2026-06-15T01:31:16.135Z","updated_at":"2026-06-15T04:07:28.382Z","approved_at":"2026-06-15T04:07:28.382Z","view_count":128,"run_count":81,"download_count":2,"like_count":1,"dislike_count":0,"score":1,"color_seed":"python","ai_summary":"这是一个 Dijkstra 最短路径算法工具,用于计算图中从起点到所有节点的最短距离和路径。","ai_usage_hint":"运行后选择手动输入矩阵或使用预设示例体验算法。","ai_analysis_source":"ai","ai_analysis_model":"deepseek-chat","ai_analysis_at":"2026-06-15T04:07:28.384Z","tags":["python","py"],"ai_tags":["最短路径","图算法","教学工具"]}</script>
3232
<script id="initial-community-data" type="application/json">{}</script>
3333
<script defer src="/assets/share-page.js?v=20260817-community-links-1"></script>
3434
</head>

0 commit comments

Comments
 (0)