菜单
Use when building or debugging variable-length paths, reachability, shortest/cheapest path, or fan-out control in GQL/Cypher-like graph queries. Triggers: variable-length path, reachability, DEPENDS_ON walk, path explode, bounded hops.
默认使用会先检查来源的 Prompt；你也可以切换为直接命令，或下载本地副本。
决定是否安装前，请先阅读 SKILL.md，以及 SkillsMP 当前展示的配套文件。
用 Codex 或 Claude 帮你安装 复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。
直接命令不会经过审查 Prompt；运行前请先检查来源。
npx skills add https://github.com/chouswei/cursor-user-skills --skill gql-path-patterns命令会保持在同一行。复制前请横向滚动并检查完整内容。
想先保存到本地？可下载 SkillsMP 当前能够提供的文件。
Keep a working plan as MemNet session rows (campaign or plan task plus ordered step tasks with execution waves). Pin the live neighbourhood, then mutate to draft, update, or repolish. At plan time, mark which steps may run in parallel. Execute a ready wave via memnet-multitask when asked. Chat is a Shape of the graph, never the plan SSOT. Triggers: memnet plan, plan in memnet, update memnet plan, repolish plan, session plan, memnet planner, plan waves, parallel plan steps, execute plan wave. Skip: Markdown-only project-planner interview with no MemNet; building the MemNet engine.
Enforceable MemNet doctrine for Cursor Multitask Mode and Task sub-agents: one shared session SSOT, TCP or streamable-http transport, parent/worker MUST/MUSTNOT, MN-REQ-12 usage, system-dev two-store pattern for modelbasedPrj-*. Triggers: Multitask Mode, multitask, multi-agent, Task sub-agent, background worker, parent coordinator, delegate worker, shared session, memnet multitask, system-dev multitask, modelbasedPrj multitask, MN-REQ-12, parallel workers, TSK_* settle, TCP serve, streamable-http MCP, GQL wire, shaped pin_map.
How to use MemNet as mission working memory: goldfish loop, chat never SSOT, drop prior maps. Triggers: use memnet, how to use memnet, memnet goldfish, mission working memory, chat never SSOT, session graph.
基于 SOC 职业分类
正在显示 SKILL.md
| name | gql-path-patterns |
| description | Use when building or debugging variable-length paths, reachability, shortest/cheapest path, or fan-out control in GQL/Cypher-like graph queries. Triggers: variable-length path, reachability, DEPENDS_ON walk, path explode, bounded hops. |
| metadata | {"pattern":"tool-wrapper","specialization":"graph-paths","domain":"data","version":"1.1"} |
| token_guardrails | - Always bound hop depth (e.g. {1,4}); never bare unbounded walks by default. - Anchor at least one endpoint with label + selective property. - Prefer DISTINCT + LIMIT when projecting nodes from fan-out paths. |
Thin skill for paths and reachability. Pair with graph-query-language for basics.
{1,3} not bare *).:REL) over untyped walks.MATCH (start:System { id: $id })-[:DEPENDS_ON]->{1,4}(dep:System)
RETURN DISTINCT dep.id AS dependency
LIMIT 200
MATCH (a:Node { id: $a })
FILTER EXISTS {
MATCH (a)-[:LINK]->{1,6}(b:Node { id: $b })
}
RETURN a.id AS reachable_from
(If EXISTS subquery is unsupported, use a bounded MATCH + count(*) > 0.)
FILTER / WHERE on start node).DISTINCT + LIMIT on projection.count, collect) instead of returning every path.MATCH p = (a:Person)-[:KNOWS]->{1,3}(b:Person)
FILTER a.id = $a AND b.id = $b
RETURN p
LIMIT 20
Return nodes/rels extracted from p if the client cannot render path values.
| Symptom | Likely cause |
|---|---|
| Timeout / OOM | Unbounded depth or missing labels |
| Empty result | Wrong direction or tighter type than data |
| Duplicate rows | Missing DISTINCT on node projection |
| Wrong end node | Undirected pattern absorbing reverse edges |
Give the bounded query first. State max depth and relationship types assumed. Add a stricter variant if the first is for exploration.