Topological Sort EngineをChatGPTとClaudeに接続

最速日

558ms

最遅日

886ms

14日間の傾向

遅延傾向+20%

Topological Sort Engine Connector

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

コネクタリンクhttps://edge.vinkius.com/vk_preview_50TICQOdkRtSSnySJVqQ2q2nkHalRtTGVu9CPbCv/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 — Topological Sort Engine capabilities are ready to use.

設定 · claude_desktop_config.jsonコピー

{
  "mcpServers": {
    "topological-sort-engine-mcp": {
      "url": "https://edge.vinkius.com/vk_preview_50TICQOdkRtSSnySJVqQ2q2nkHalRtTGVu9CPbCv/mcp"
    }
  }
}

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

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

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

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

• 01

  DevOps Engineers

  They hand off build system configurations to the AI to resolve task orders.

• 02

  Software Architects

  They use it to validate dependency graphs in complex software designs.

• 03

  Data Engineers

  They use it to manage execution pipelines and task scheduling.

• 01

  What is this MCP used for?

  It is used to perform topological sorting on directed acyclic graphs (DAGs) to resolve dependencies and find circular loops.

• 02

  How does it handle circular dependencies?

  You can use the identify_cycles capability to find the specific nodes that are causing the circularity.

• 03

  Which algorithms are included?

  The MCP includes Kahn's Algorithm for linear ordering and Depth-First Search (DFS) for traversal.

• 04

  Can I use this with Claude or Cursor?

  Yes, you can connect this MCP to any MCP-compatible client like Claude, Cursor, or Windsurf.

• 05

  Do I need to host the MCP myself?

  No, Vinkius hosts and manages the MCP for you, so it is ready to use immediately after connection.

• 06

  What is the difference between Kahn's algorithm and DFS-based sorting?

  Kahn's algorithm uses an in-degree reduction approach (BFS), while the DFS-based method explores paths deeply before backtracking to reconstruct the sequence.

• 07

  How can I find nodes that are causing a circular dependency?

  You can use the identify_cycles capability, which specifically traverses the graph to isolate and return only the nodes involved in loops.

• 08

  What happens if my input graph is not a DAG?

  If a cycle is detected, the sorting capabilities will return a failure state with an error message describing the nature of the loop.

• 

  Dependency Resolution Engine AIコネクタ

  Deterministic dependency resolution for agent tool and plugin loading.

  表示
• 

  Task DAG Dependency Resolver AIコネクタ

  Resolves task execution order and parallel groups from DAG dependencies.

  表示
• 

  Circular Code Dependency Detector AIコネクタ

  Identify import cycles and measure module interdependence in JavaScript, TypeScript, and Python projects.

  表示
• 

  DAG Topological Scheduler AIコネクタ

  Deterministic task scheduling and critical path analysis for multi-agent DAGs.

  表示

おすすめ

• 

  Dependency Version Conflict Detector AIコネクタ

  Identify and resolve versioning incompatibilities within dependency trees.

  表示
• 

  CrewAI Task Dependency Graph Validator AIコネクタ

  Ensures multi-agent task sequences are free of circular logic and properly ordered.

  表示
• 

  Language Detector Engine AIコネクタ

  Detect the language of any text local using exact n-gram analysis. Supports 400+ languages. When AI guesses wr

  表示
• 

  Outlier Detection Engine AIコネクタ

  Identify statistical anomalies in massive datasets local using deterministic Z-Score and IQR methods. Stop LLM

  表示