一键在 Manus 中运行任何 Skill

tree-rerooting

星标66

分支1

更新时间2026年5月17日 09:22

Re-root an undirected tree from any node using DFS/BFS. Use when changing the point of view in a tree, finding paths between nodes, or reparenting tree structures.

安装

用 Codex 或 Claude 帮你安装复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。

在 Manus 中运行

来源

knoopx

knoopx/pi

打开 GitHub 仓库查看创作者相关仓库

下载

在 Manus 中运行

When to use

Re-rooting an undirected tree from a new node.

Rules

Build an undirected adjacency map (parent↔children become symmetric neighbor sets)
Do DFS/BFS from the target node
Every node you visit gets its parent set to the node you came from
Its children become all neighbors minus that parent
Path-between(a, b): re-root at a, then walk from b up parent pointers until you hit a
If the target node is not in the tree, return None (not an error)
NEVER mutate the original tree when re-rooting — build a fresh node structure
ALWAYS keep the original tree intact so repeated from_pov calls work correctly

Complexity

O(N) per re-root.

Example

Path between a and b: build adjacency map, DFS from a as root, then walk from b up parent pointers to a. Always build a fresh structure — never mutate the original tree.

同仓库更多 Skills

同仓库

markdown-rendering

knoopx/pi

Renders markdown to self-contained HTML with a custom dark stylesheet and opens in browser. Use when previewing markdown documents, generating styled HTML from README or report files.

2026-05-1966

notify

knoopx/pi

Inform the user what is happening — skip passive lookups

2026-05-1966

jj-core

knoopx/pi

Manage version control with Jujutsu (jj) — no staging area, immediate changes, smart rebasing. Use when navigating history, squashing, or pushing to Git remotes.

2026-05-1966

jj-hunk

knoopx/pi

Programmatic hunk selection for Jujutsu — split, commit, or squash specific hunks without interactive prompts. Use when making partial commits or selective squashes.

2026-05-1966

research-protocol

knoopx/pi

Gather facts from the web using evidence-first approach with mandatory citations. Use when researching topics, answering factual questions, or any task requiring web-sourced evidence.

2026-05-1966

bfs-state-space

knoopx/pi

Model minimum-move problems as BFS over a state space. Use when solving bucket pouring puzzles, sliding tiles, or any problem asking for the shortest sequence of moves to reach a goal.

2026-05-1766

name	tree-rerooting
description	Re-root an undirected tree from any node using DFS/BFS. Use when changing the point of view in a tree, finding paths between nodes, or reparenting tree structures.
topic	Tree Re-Rooting (POV)
token_cost	120
related	["tree-zipper","dfs-vs-bfs"]
keywords	["re-root","reroot","pov","point of view","tree rotation","change root","from_pov","reparent","path between nodes","undirected tree"]

When to use

Re-rooting an undirected tree from a new node.

Rules

Build an undirected adjacency map (parent↔children become symmetric neighbor sets)
Do DFS/BFS from the target node
Every node you visit gets its parent set to the node you came from
Its children become all neighbors minus that parent
Path-between(a, b): re-root at a, then walk from b up parent pointers until you hit a
If the target node is not in the tree, return None (not an error)
NEVER mutate the original tree when re-rooting — build a fresh node structure
ALWAYS keep the original tree intact so repeated from_pov calls work correctly

Complexity

O(N) per re-root.

Example

Path between a and b: build adjacency map, DFS from a as root, then walk from b up parent pointers to a. Always build a fresh structure — never mutate the original tree.