Minimum Spanning Tree Service Connector for AI agents.
3 live capabilities
Solve complex network connectivity and graph theory problems for infrastructure planning.
Waiting for input…
Why people use Minimum Spanning Tree Service
Minimum Spanning Tree Calculator for Network Connectivity
With this Connector, you just give your agent the list of locations and the costs to connect them. It runs the math instantly and gives you the exact edges you need to keep. You get a verified, optimal plan in seconds instead of spending an afternoon on manual verification.
What Vinkius changes
You provide the data and the Connector gives you the most efficient connection plan.
Use it from Claude, ChatGPT, Cursor or another AI client you already have.
One account · 6,100+ Connectors
- Real-world use case 01
Fiber Optic Layout
A network engineer asks the agent to find the cheapest way to connect 20 cities.
- Real-world use case 02
Logistics Optimization
A logistics manager wants to connect warehouses with the lowest transport cost.
- Real-world use case 03
Game Level Generation
A game dev needs a procedural map where all rooms are connected.
Complete set · 3capabilities
The complete Minimum Spanning Tree Service capability set.
These are the exact actions your AI can choose when you ask it to work with Minimum Spanning Tree Service.
01—03
3 capabilities in this set.
Part of 3 available through Minimum Spanning Tree Service.
- 01 Capability
Compute kruskal mst
Calculates the Minimum Spanning Tree using Kruskal's algorithm. Use this to find the cheapest way to connect all nodes in a graph.
- 02 Capability
Compute max spanning tree
Calculates the Maximum Spanning Tree. This is useful for finding the highest-weight connections in a network.
- 03 Capability
Compute prim mst
Calculates the Minimum Spanning Tree using Prim's algorithm. This grows a tree from a specific starting node.
Set up in minutes
One URL. Then ask Minimum Spanning Tree Service to work.
Claude and ChatGPT only need the Connector URL. Copy it once, add it in settings, and use Minimum Spanning Tree Service 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_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service, and paste the URL above.
- Step 03
Turn it on in chat
Select +, open Connectors, and enable Minimum Spanning Tree Service for the conversation.
ChatGPT · Web + desktop
Connector URL · ready to paste
Streamable HTTPhttps://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service URL.
- Step 03
Save and start
Save the connection and enable Minimum Spanning Tree Service in your conversation. Desktop may ask you to restart once.
Cursor · IDE configuration
Advanced setup
{
"mcpServers": {
"minimum-spanning-tree-calculator": {
"url": "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service
Open Agent mode in chat and ask: "Using Minimum Spanning Tree Service, help me...". 3 tools available
VS Code Copilot · IDE configuration
Advanced setup
{
"mcpServers": {
"minimum-spanning-tree-calculator": {
"url": "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service
Ask Copilot: "Using Minimum Spanning Tree Service, help me...". 3 tools available
Windsurf · IDE configuration
Advanced setup
{
"mcpServers": {
"minimum-spanning-tree-calculator": {
"url": "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service
Open Cascade and ask: "Using Minimum Spanning Tree Service, help me...". 3 tools available
Cline · IDE configuration
Advanced setup
{
"mcpServers": {
"minimum-spanning-tree-calculator": {
"url": "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service
Ask Cline: "Using Minimum Spanning Tree Service, help me...". 3 tools available
Claude Code · Terminal command
Advanced setup
claude mcp add minimum-spanning-tree-calculator --transport http "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service
Ask Claude: "Using Minimum Spanning Tree Service, show me...". 3 tools are ready
Where the request belongs
Work Minimum Spanning Tree Service can move forward.
This is for engineers and designers who need to connect multiple points with minimal cost or weight. It saves you from manual graph theory calculations and prevents you from building redundant loops in your infrastructure.
Network Engineer
Uses the capability to find the cheapest way to lay fiber optic cables across a city.
Logistics Planner
Determines the most efficient way to connect distribution centers with the lowest transport costs.
Game Developer
Generates procedural maps or level paths that connect all points in a game world without overlap.
Build the capability set
Add more capabilities.
Each Connector adds new actions and data without changing how you work.
Browse Connectors
Shortest Path Engine
Find optimal paths in weighted graphs using Dijkstra, A*, and Bellman-Ford algorithms.
Network Flow Calculator
Solve maximum flow, minimum cut, and bipartite matching problems using Edmonds-Karp.
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 Minimum Spanning Tree Service 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 Minimum Spanning Tree Service.
The practical details behind the request, access and result.
Can the Minimum Spanning Tree Calculator find the cheapest path between two cities?
No, this capability finds the cheapest way to connect all points in a network. For the shortest path between just two specific points, you would need a different algorithm like Dijkstra.
How does the Minimum Spanning Tree Calculator handle disconnected points?
The Connector will identify if your data forms a single tree or a spanning forest. It will give you the best connections for each group of connected points.
What is the difference between Kruskal's and Prim's in the Minimum Spanning Tree Calculator?
Kruskal's algorithm picks the smallest edges from the whole list first, while Prim's grows the tree from a specific starting point. Both find the same minimum weight.
Can the Minimum Spanning Tree Calculator help with logistics and delivery?
Yes, it is perfect for logistics. It helps you determine the lowest-cost way to link multiple distribution centers or warehouses into a single network.
What happens if my graph has no connections?
If there are no edges provided, the Connector will let you know that no connections can be made. It requires a list of sources, targets, and weights to work.
Can I use the Minimum Spanning Tree Calculator for game design?
Absolutely. It is often used to generate procedural maps or paths that ensure every room or area is connected without creating unnecessary loops.
What is the difference between Kruskal's and Prim's algorithms?
Kruskal's algorithm sorts all edges by weight and adds them if they don't form a cycle, making it efficient for sparse graphs. Prim's algorithm starts from a specific node and expands the tree by picking the cheapest edge connected to the current tree.
How do I calculate a Maximum Spanning Tree?
You can use the compute_max_spanning_tree capability. It internally negates the edge weights to apply MST logic, effectively finding the set of edges with the highest total weight.
What happens if my graph is disconnected?
If the input graph has multiple components, the capabilities will return a spanning forest. The isForest property in the response will be set to true.
One connection away
Give your agent a direct line to Minimum Spanning Tree Service.
Connect Minimum Spanning Tree Service once. Keep it beside 6,100+ managed Connectors when the next task needs more.
Explore every Connector No credit card required · Free tier available