Download PDFMarkdown Version
ClaudeChatGPTPerplexityGeminiMicrosoft CopilotRaycastMeta AIGrokZ.aiQwenKimi
DeepSeekMistralCursorVS CodeWindsurfJetBrainsClineLovableVercel AI SDKLangChain

Use Shortest Path Engine with your AI.

Connect your account once and let the AI you already use work with it, without building another integration. Find optimal paths in weighted graphs using Dijkstra, A*, and Bellman-Ford algorithms.

Included with plan

Ask AI about this Connector

Developed, maintained, and hosted by Vinkius.

MCP VERIFIED · PRODUCTION READY · VINKIUS GUARANTEED

Waiting for input…

Works with modern AI clients that support MCP, including ChatGPT, Claude, Cursor, and more.

ChatGPTClaudeCursorPerplexityGeminiMicrosoft CopilotRaycastMeta AI

Complete set · 3 capabilities

The complete Shortest Path Engine capability set.

These are the exact actions your AI can choose when you ask it to work with Shortest Path Engine.

Capability set01 / 01

01-03

3 capabilities in this set.

Part of 3 available through Shortest Path Engine.

  1. 01

    Dijkstra

    Do NOT use for negative weights. Find the shortest path using Dijkstra algorithm

  2. 02

    Astar

    Do NOT use for simple unweighted graphs. Find the shortest path using A* search

  3. 03

    Bellman ford

    Scan graph using Bellman-Ford algorithm

Observed, not estimated

645ms average. Fast in production.

Shortest Path Engine is checked daily against the live service.

Daily averagePeak 754ms
Aug 20Today
Fastest day
492ms
Slowest day
754ms
14-day trend
Slowing+10%

Connect your client

One URL. Every client.

Activate the Connector, copy your link, and paste it into the client you already use. 3 capabilities arrive ready to run.

Preview access · not provider authentication

The vk_preview_* token belongs to Vinkius preview infrastructure. It lets Claude discover and display the capabilities of Shortest Path Engine, so you can see the experience inside your AI.

It does not authenticate your account with Shortest Path Engine. Actions requiring credentials or live account data may not run until you activate the Connector and authorize the service.

Shortest Path Engine Connector

You're all set. Choose your MCP client and follow the setup instructions.

Connector linkhttps://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp

Claude Desktop

Follow the steps below to connect in seconds.

  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.
Configuration · claude_desktop_config.jsonCopy
{
  "mcpServers": {
    "shortest-path-engine-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
    }
  }
}
  • Claude
  • ChatGPT
  • Cursor
  • VS Code
  • Windsurf
  • Claude Code
  • JetBrains
  • Cline

Step-by-step instructions for each client are in the guide. How to connect

FAQ

Questions Shortest Path Engine owners ask.

  • 01

    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.

  • 02

    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.

  • 03

    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.

Explore

More in Algorithms

Suggestions