图最短路径计算器（Dijkstra 手算辅助）

POST https://api.elysiatools.com/zh/api/tools/graph-shortest-path

{
  "mcpServers": {
    "elysiatools-graph-shortest-path": {
      "name": "graph-shortest-path",
      "description": "Dijkstra 最短路径的手算辅助工具：输入 1–30 条边（每行：起点、终点、权重）与起点/终点，默认无向、可切换有向。逐轮记录“定居哪个节点、距离多少、每次松弛如何更新临时距离表”，平局按字典序取最小节点名，日志与教科书演算完全一致；负权重按业务拒绝，终点不可达作为合法结果报告。经典例：A-B 4、A-C 2、B-C 5、B-D 10、C-E 3、D-E 4、D-F 11、E-F 8，从 A 到 F → 最短距离 13，路径 A→C→E→F。",
      "baseUrl": "https://api.elysiatools.com/mcp/sse?toolId=graph-shortest-path",
      "command": "",
      "args": [],
      "env": {},
      "isActive": true,
      "type": "sse"
    }
  }
}

{
  "jsonrpc": "2.0",
  "id": 1,
  "method": "tools/list"
}

{
  "jsonrpc": "2.0",
  "id": 2,
  "method": "tools/call",
  "params": {
    "name": "graph-shortest-path",
    "arguments": {
  "edges": "A B 4\nA C 2\nB C 5\nB D 10\nC E 3\nD E 4\nD F 11\nE F 8",
  "source": "A",
  "target": "F",
  "directed": false,
  "decimalPlaces": 2
}
  }
}