Shortest Path Engine Connector for AI agents.
3 live capabilities
Calculate optimal navigation routes and network paths in complex weighted graphs.
Waiting for input…
Why people use Shortest Path Engine
Shortest Path Engine for Logistics and Route Optimization
With this Connector, you just feed the network of roads and costs to your agent. It uses dijkstra to instantly spit out the most efficient route, saving you hours of manual planning and ensuring your fleet stays on the most cost-effective path.
What Vinkius changes
Your AI handles the complex math of graph traversal so you can get straight to the results.
Use it from Claude, ChatGPT, Cursor or another AI client you already have.
One account · 6,100+ Connectors
- Real-world use case 01
Optimizing delivery routes
A delivery company needs to find the cheapest route for a truck.
- Real-world use case 02
NPC movement in RPGs
An RPG needs an NPC to move across a village.
- Real-world use case 03
Detecting network loops
A sysadmin wants to find a loop in a server network.
Complete set · 3capabilities
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.
01—03
3 capabilities in this set.
Part of 3 available through Shortest Path Engine.
- 01 Capability
Dijkstra
Calculate the most efficient route in a graph with non-negative weights. It is the standard for most basic pathfinding tasks.
- 02 Capability
Astar
Find the shortest path using A* search with spatial heuristics like Manhattan or Euclidean distance. It is best for maps with spatial data.
- 03 Capability
Bellman ford
Scan a graph to find the shortest path and detect negative cycles. Use this for networks that include negative edge weights.
Set up in minutes
One URL. Then ask Shortest Path Engine to work.
Claude and ChatGPT only need the Connector URL. Copy it once, add it in settings, and use Shortest Path Engine from the conversation.
Choose your client
Live previewAdvanced clients IDE · CLI
Claude · Web + desktop
Connector URL · ready to paste
Streamable HTTPhttps://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp - Step 01
Open Connectors
In Claude Web or Claude Desktop, open Settings and choose Connectors.
- Step 02
Add the URL
Choose Add custom connector, name it Shortest Path Engine, and paste the URL above.
- Step 03
Turn it on in chat
Select +, open Connectors, and enable Shortest Path Engine for the conversation.
ChatGPT · Web + desktop
Connector URL · ready to paste
Streamable HTTPhttps://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp - Step 01
Open MCP settings
On desktop, open Settings and MCP servers. On web, open your workspace app or connector settings.
- Step 02
Add the URL
Choose Add server with Streamable HTTP, or create a custom MCP app, then paste the Shortest Path Engine URL.
- Step 03
Save and start
Save the connection and enable Shortest Path Engine in your conversation. Desktop may ask you to restart once.
Cursor · IDE configuration
Advanced setup
{
"mcpServers": {
"shortest-path-engine": {
"url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
}
}
}- Step 01
Open MCP Settings
Press Cmd+Shift+P (macOS) or Ctrl+Shift+P (Windows/Linux) → search "MCP Settings"
- Step 02
Add the server config
Paste the JSON configuration above into the mcp.json file that opens
- Step 03
Save the file
Cursor will automatically detect the new Connector
- Step 04
Start using Shortest Path Engine
Open Agent mode in chat and ask: "Using Shortest Path Engine, help me...". 3 tools available
VS Code Copilot · IDE configuration
Advanced setup
{
"mcpServers": {
"shortest-path-engine": {
"url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
}
}
}- Step 01
Create MCP config
Create a .vscode/mcp.json file in your project root
- Step 02
Add the server config
Paste the JSON configuration above
- Step 03
Enable Agent mode
Open GitHub Copilot Chat and switch to Agent mode using the dropdown
- Step 04
Start using Shortest Path Engine
Ask Copilot: "Using Shortest Path Engine, help me...". 3 tools available
Windsurf · IDE configuration
Advanced setup
{
"mcpServers": {
"shortest-path-engine": {
"url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
}
}
}- Step 01
Open MCP Settings
Go to Settings → MCP Configuration or press Cmd+Shift+P and search "MCP"
- Step 02
Add the server
Paste the JSON configuration above into mcp_config.json
- Step 03
Save and reload
Windsurf will detect the new server automatically
- Step 04
Start using Shortest Path Engine
Open Cascade and ask: "Using Shortest Path Engine, help me...". 3 tools available
Cline · IDE configuration
Advanced setup
{
"mcpServers": {
"shortest-path-engine": {
"url": "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"
}
}
}- Step 01
Open Cline MCP Settings
Click the Connectors icon in the Cline sidebar panel
- Step 02
Add remote server
Click "Add Connector" and paste the configuration above
- Step 03
Enable the server
Toggle the server switch to ON
- Step 04
Start using Shortest Path Engine
Ask Cline: "Using Shortest Path Engine, help me...". 3 tools available
Claude Code · Terminal command
Advanced setup
claude mcp add shortest-path-engine --transport http "https://edge.vinkius.com/vk_preview_4jILbpr2C69ixKP1k3DHsnYznMAVua4uNkxoZ0qs/mcp"- Step 01
Install Claude Code
Run npm install -g @anthropic-ai/claude-code if not already installed
- Step 02
Add the Connector
Run the command above in your terminal
- Step 03
Verify the connection
Run claude mcp to list connected servers, or type /mcp inside a session
- Step 04
Start using Shortest Path Engine
Ask Claude: "Using Shortest Path Engine, show me...". 3 tools are ready
Where the request belongs
Work Shortest Path Engine can move forward.
This is for the software engineer tired of manual pathfinding logic, the game dev building a navigation mesh, or the logistics analyst trying to optimize a messy supply chain.
Game Developer
They use this to build NPC navigation systems and ensure characters move naturally across a village or dungeon map.
Logistics Analyst
They use it to optimize delivery routes and warehouse flows by calculating the lowest cost across multiple stops.
Network Engineer
They use it to map out data flow and identify bottlenecks or cycles in complex server infrastructures.
Build the capability set
Add more capabilities.
Each Connector adds new actions and data without changing how you work.
Browse Connectors
Network Flow Calculator
Solve maximum flow, minimum cut, and bipartite matching problems using Edmonds-Karp.
Minimum Spanning Tree Calculator
Calculate Minimum and Maximum Spanning Trees using Kruskal's and Prim's algorithms.
Graph Analysis Toolkit
Deep structural analysis of directed and undirected graphs, providing metrics on connectivity, topology, and node importance.
Topological Sort Engine
Perform topological sorting on DAGs using Kahn's and DFS algorithms to resolve dependencies and detect cycles.
GraphHopper
Empower routing and geocoding via GraphHopper. calculate optimal routes, perform reverse geocoding, solve vehicle routing problems, and analyze reachability directly from any AI agent.
OpenRouteService
Plan routes and analyze spatial data via OpenRouteService. calculate directions, isochrones, distance matrices, VRP optimization, and geocoding from any AI agent.
Bring your own AI
Change the model, client or framework. Keep Shortest Path Engine connected.
-
Claude -
ChatGPT -
Gemini -
Cursor -
VS Code -
Windsurf -
ZCode -
Cline -
Zed -
Continue -
Kiro -
Roo Code -
Zencoder -
Goose -
Void -
Augment Code -
Amp -
Qodo -
Tabnine -
Pieces -
Sourcegraph Cody -
JetBrains -
Warp -
Amazon Q -
Antigravity -
BoltAI -
Raycast -
Jan -
LM Studio -
AnythingLLM -
Open WebUI -
Msty -
Cherry Studio -
LibreChat -
TypingMind -
Chorus -
5ire -
n8n -
LangChain -
LlamaIndex -
CrewAI -
Vercel AI SDK
Before you connect
Questions about Shortest Path Engine.
The practical details behind the request, access and result.
Can the Shortest Path Engine find the cheapest route for my delivery business?
Yes, it calculates the lowest cost path across a weighted network. You just provide the locations and costs, and it handles the math to find the most efficient route.
How does the Shortest Path Engine handle negative costs in a network?
It uses the bellman_ford algorithm specifically for this. This is great for complex financial or credit networks where costs can be negative.
Is the Shortest Path Engine good for video game NPC movement?
It is perfect for that. Using the astar capability, your AI can calculate paths across a game map using spatial heuristics like Manhattan distance.
Can I use the Shortest Path Engine to map out a city's water pipes?
Yes, it can calculate reachability maps. It shows you which areas can be reached from a main source and the total distance required for the layout.
What's the difference between the algorithms in the Shortest Path Engine?
Dijkstra is best for standard positive weights, astar is faster for maps with spatial data, and bellman_ford handles negative weights.
Does the Shortest Path Engine work for large-scale data?
It works well for any graph that fits within your AI client's context. For massive global datasets, you should feed it specific sub-networks to ensure accuracy.
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.
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.
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.
One connection away
Give your agent a direct line to Shortest Path Engine.
Connect Shortest Path Engine once. Keep it beside 6,100+ managed Connectors when the next task needs more.
Explore every Connector No credit card required · Free tier available