
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 分