
Depmap
io.github.CloudCorpRecords由 GitHub 帳號 CloudCorpRecords 發布v0.1.0更新於 Nov 3, 2026
monorepo 包的內部依賴關係圖,以結構化資料和 Mermaid 圖表呈現。
AI 翻譯由 AI 模型根據下方的原文描述翻譯,可能有誤。
原文描述
Internal dependency map for monorepo packages, as structured data and a Mermaid graph.
概覽
Depmap 的本機 MCP 服務;無需登入;STDIO。
暫無 AI 概覽:以下資訊來自註冊中心條目和服務本身。
安裝
在 SourceWeft 中
- 開啟 儀表板中的 Depmap,將其新增到工作區。
- 為需要使用其工具的對話啟用該服務。
Desktop only,透過 STDIO。 STDIO 服務會啟動本機處理程序,因此需要 SourceWeft 桌面主機。
其他 MCP 客戶端
參照 儲存庫 中的啟動說明。
README
depmap
A monorepo is easy to lose track of: which packages actually depend on which other packages in the set, what sits at the top with nothing depending on it, what sits at the bottom depending on nothing internal, and whether the internal graph loops back on itself. depmap takes the package graph — every package's name and the names it depends on — and draws the whole map:
- Per-package entries — for every package, its internal
dependencies (
depends_on), the packages that depend on it (depended_by), andexternal_count: how many of its dependency names point outside the set. External names are counted, never mapped, and never an error — a package may freely depend on libraries the monorepo does not contain. - Edges, roots, and leaves — every internal dependency
as a
{from, to}edge, the roots (packages nothing internal depends on), and the leaves (packages with no internal dependencies). - Cycles, two ways —
cyclic_packageslists every package that lies on any cycle: members of a strongly connected component of more than one package, plus any package that depends on itself. Alongside it,cyclereports one concrete cycle, found by a depth-first search that visits names and dependencies in ascending order. A cycle is a finding, not an error. - A Mermaid graph — the map rendered as a
graph TDdiagram you can paste into any Mermaid renderer. Package names that are not valid Mermaid ids get a sanitised id (@scope/appbecomes_scope_app) with a declaration line tying the id back to the real name.
Duplicate entries in one package's dependencies are
de-duplicated before mapping, and every list in the result
is sorted ascending, so the same graph always yields
exactly the same map. Malformed input — a missing or empty
package list, a missing or duplicate package name, a
wrongly typed field — is a validation error naming the
offending path (for example
packages[1].dependencies[0] must be a string), and no
partial map is produced. The computation is pure and
local: no network, no configuration, no files read beyond
the input you pass in.
CLI
args.json contains the full arguments object:
dependencies defaults to [] per package; here react
is external to the set, so it appears only in app's
external_count. The map is printed as JSON:
Exit codes: 0 on success, 1 on a runtime error (including
an unreadable or invalid input file, or invalid input), 2
on a usage error.
MCP server
MCP client config:
Tools
-
map_internal_dependencies— Map a monorepo's internal dependencies.packages(array, required, at least one) — packages as{name, dependencies?}objects;nameis unique across the set, and eachdependenciesentry either names another supplied package (internal) or anything else (external, counted only)
Returns
{packages, edges, roots, leaves, has_cycle, cycle, cyclic_packages, mermaid}.
Docker
Development
License
MIT — Copyright (c) 2026 Rene Turcios
來源:README.md,提交 76296f7
工具
0版本歷史
1- v0.1.0最新Nov 3, 2026
評分
已滿足適用檢查項的 50%
該評分衡量此收錄條目的完整程度,依據註冊中心條目、端點與公開來源計算得出。它不是對伺服器本身的評價,也不表示伺服器安全或目前可用:可連通性是帶日期的檢查結果,評分也不包含安裝量或使用者評價。
- 近 30 天內可連通25 分
請保持端點能夠回應 MCP 握手;SourceWeft 每 30 天探測一次。
- 已宣告認證方式10 分
請在註冊中心條目中宣告憑證請求標頭,或保持端點能夠回應探測,以便判定其認證方式。
- 已列出工具15 分
請讓伺服器在無憑證時回應 tools/list,或發布可在沙箱中無憑證啟動的軟體包。
- 描述必需15 分
- 圖示10 分
- 文件15 分
- 授權條款10 分