Network Flow CalculatorをChatGPTとClaudeに接続

最速日

547ms

最遅日

838ms

14日間の傾向

遅延傾向+12%

Network Flow Calculator Connector

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

コネクタリンクhttps://edge.vinkius.com/vk_preview_RdnwvPuYcoCX6OJTAFit8YmeHqPSTC3vBsEOyNwx/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 — Network Flow Calculator capabilities are ready to use.

設定 · claude_desktop_config.jsonコピー

{
  "mcpServers": {
    "network-flow-calculator-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_RdnwvPuYcoCX6OJTAFit8YmeHqPSTC3vBsEOyNwx/mcp"
    }
  }
}

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

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

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

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

• 01

  物流エンジニア

  輸送ネットワークの容量分析や配送ルートの最適化に使用します。

• 02

  ネットワーク管理者

  データ通信のルーティング容量やボトルネックの特定に利用します。

• 03

  データサイエンティスト

  グラフ理論を用いたリソース配分や割り当て問題の解決に活用します。

• 01

  What algorithm does this MCP use?

  This MCP uses the Edmonds-Karp algorithm to solve flow and matching problems.

• 02

  Which AI clients can I use with this MCP?

  You can use this with any MCP-compatible client, including Claude, Cursor, Windsurf, and VS Code.

• 03

  Can I find bottlenecks in my network?

  Yes, you can use the find_min_cut capability to identify the edges that limit your network capacity.

• 04

  How do I solve assignment problems?

  You can use the compute_bipartite_matching capability to solve assignment and scheduling tasks.

• 05

  Do I need to host this myself?

  No, Vinkius hosts and manages the MCP for you, so it is ready to use once you connect.

• 06

  What algorithms are used for the calculations?

  The server uses the Edmonds-Karp algorithm, which is a BFS-based implementation of the Ford-Fulkerson method, to ensure finding the shortest augmenting paths.

• 07

  How can I use this for bipartite matching?

  You can use the compute_bipartite_matching capability by providing two sets of nodes and their possible connections. The capability internally transforms the problem into a flow network to find the maximum number of unique pairs.

• 08

  Can this capability identify bottlenecks in my network?

  Yes, by using find_min_cut, you can identify the specific edges that constitute the minimum cut, which are the primary bottlenecks limiting flow from your source to your sink.

• 

  Graph Analysis Toolkit AIコネクタ

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

  表示
• 

  Cut-Off Grade Optimization AIコネクタ

  Optimize mining cut-off grades to maximize NPV and production efficiency.

  表示
• 

  Minimum Spanning Tree Calculator AIコネクタ

  Calculate Minimum and Maximum Spanning Trees using Kruskal's and Prim's algorithms.

  表示
• 

  Hose Flow & Volume Calculator AIコネクタ

  Calculate water volume, duration, and irrigation limits.

  表示

おすすめ

• 

  WeChat Mini-Programs / 微信小程序 AIコネクタ

  China's dominant mini-app ecosystem — manage users, phone numbers, and messaging via AI.

  表示
• 

  Douyin Mini-Game AIコネクタ

  Douyin mini-game developer API — manage cloud storage, leaderboards, user sessions, and content moderation for

  表示
• 

  Kuaishou Mini-Game AIコネクタ

  Kuaishou mini-game developer API — manage cloud storage, leaderboards, analytics, and content moderation for c

  表示
• 

  Collision Theory Calculator AIコネクタ

  Calculates collision parameters for gas molecules using kinetic theory.

  表示