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

Use Minimum Spanning Tree Service with your AI.

Connect your account once and let the AI you already use work with it, without building another integration. Calculate Minimum and Maximum Spanning Trees using Kruskal's and Prim's 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 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.

Capability set01 / 01

01-03

3 capabilities in this set.

Part of 3 available through Minimum Spanning Tree Service.

  1. 01

    Compute kruskal mst

    Calculates the Minimum Spanning Tree using Kruskal's algorithm

  2. 02

    Compute max spanning tree

    Calculates the Maximum Spanning Tree

  3. 03

    Compute prim mst

    Calculintates the Minimum Spanning Tree using Prim's algorithm

Observed, not estimated

640ms average. Fast in production.

Minimum Spanning Tree Service is checked daily against the live service.

Daily averagePeak 821ms
Aug 20Today
Fastest day
508ms
Slowest day
821ms
14-day trend
Slowing+36%

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 Minimum Spanning Tree Service, so you can see the experience inside your AI.

It does not authenticate your account with Minimum Spanning Tree Service. Actions requiring credentials or live account data may not run until you activate the Connector and authorize the service.

Minimum Spanning Tree Service Connector

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

Connector linkhttps://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 — Minimum Spanning Tree Service capabilities are ready to use.
Configuration · claude_desktop_config.jsonCopy
{
  "mcpServers": {
    "minimum-spanning-tree-calculator-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_RDp7HdTV6jL7l2yjzgw6M9KqQhoK7Tlqj178gMmL/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 Minimum Spanning Tree Service owners ask.

  • 01

    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.

  • 02

    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.

  • 03

    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.

Explore

More in Mathematics

Suggestions