Shortest Path EngineをChatGPTとClaudeに接続

最速日

551ms

最遅日

1001ms

14日間の傾向

安定+1%

Shortest Path Engine Connector

準備完了です。MCPクライアントを選択し、セットアップ手順に従ってください。

コネクタリンクhttps://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcpコピー

Claude Desktop

以下の手順で数秒で接続できます。

1. 1In Claude Desktop, open Settings → Connectors.
2. 2Click “Add custom connector” and paste the connector link above as the remote MCP server URL.
3. 3Click Add and start a new chat — Shortest Path Engine capabilities are ready to use.

設定 · claude_desktop_config.jsonコピー

{
  "mcpServers": {
    "shortest-path-engine-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
    }
  }
}

• Claude
• ChatGPT
• Cursor
• VS Code
• Windsurf
• Claude Code
• JetBrains
• Cline

各クライアントの手順ガイドはこちらです。 接続方法

Claude向けのガイド付きセットアップ？ Shortest Path EngineをClaudeや他のAIに設定する

このConnectorが対応するすべてのAIクライアントを見る ↑

• 01

  データサイエンティスト

  複雑なデータ構造における最適な経路や距離の計算に利用します。

• 02

  ネットワークエンジニア

  通信ネットワークや物流ルートの最適化アルゴリズムの実装に活用します。

• 03

  アルゴリズム開発者

  グラフアルゴリズムの検証や、特定の条件下での経路探索のテストに使用します。

• 01

  Can I use Dijkstra for graphs with negative weights?

  No. Dijkstra is designed for graphs with non-negative weights. For graphs with negative weights, you should use the Bellman-Ford capability.

• 02

  What makes A* different from Dijkstra?

  A* uses spatial heuristics like Manhattan or Euclidean distance to find the path more efficiently than Dijkstra.

• 03

  How do I use this with Claude or Cursor?

  You connect to the Vinkius-hosted MCP once. After that, your agent in Claude, Cursor, or Windsurf will automatically see these capabilities as available functions.

• 04

  Does this MCP handle directed graphs?

  Yes. The engine can calculate paths for both directed and undirected weighted graphs.

• 05

  Can it detect infinite loops?

  Yes. The Bellman-Ford capability is specifically designed to detect negative cycles that would cause infinite cost-reduction loops.

• 06

  When should I use the Dijkstra capability?

  Use dijkstra when you are certain that all edge weights in your graph are zero or positive. It is highly efficient for standard shortest-path queries.

• 07

  Can I use A* search without a heuristic?

  The astar capability requires a valid heuristicType (either EUCLIDEAN or MANSDT) to guide its search. Without a spatial estimate, the algorithm cannot function as intended.

• 08

  How does the engine handle negative edge weights?

  For graphs with negative weights, you must use bellman_ford. This capability is specifically designed to process negative edges and identify if a negative cycle exists in your graph.

• 

  A* Pathfinder AIコネクタ

  Deterministic A* pathfinding for grid-based navigation.

  表示
• 

  Graph Analysis Toolkit AIコネクタ

  Deep structural analysis of directed and undirected graphs, providing metrics on connectivity, topology, and n

  表示
• 

  Hasura (Instant GraphQL & REST Engine) AIコネクタ

  Instantly connect to your Hasura engine to execute GraphQL queries, manage metadata, analyze SQL execution pla

  表示
• 

  Causal-Graph Navigator AIコネクタ

  LLMs reason by statistical proximity, confusing word co-occurrence with direct causal relationships. This tool

  表示

おすすめ

• 

  Construction Schedule Critical Path Engine AIコネクタ

  High-precision CPM scheduling engine for construction timelines and critical path analysis.

  表示
• 

  Ada Lovelace Algorithmic Prover AIコネクタ

  Your AI said 'process the data' and called it an algorithm. That is not an algorithm — that is a wish. No step

  表示
• 

  Graph Coloring Scheduler AIコネクタ

  Deterministic agent scheduling using graph coloring to prevent resource conflicts.

  表示
• 

  JSON Path Query Engine AIコネクタ

  Extract specific data from massive JSON payloads using JSONPath expressions.

  表示