by0xmariowu· 55 skills
Represent a research plan as a directed graph — nodes are sub-questions, edges are "answer-depends-on" dependencies. Independent nodes can be executed in parallel; downstream nodes wait for their predecessors. Borrowed from MindSearch's WebSearchGraph pattern. Replaces list/tree decomposition for plans with non-linear dependencies.
$npx -y skills add 0xmariowu/autosearch --skill graph-search-planInstalls into the current project.
Run `npx skills use "https://github.com/0xmariowu/autosearch" --skill "0xmariowu/autosearch/graph-search-plan"` and follow the generated skill instructions now. Read its complete output, redirecting it to a temporary file first if necessary. Resolve relative paths from the supporting-files directory it provides.
Use the skills in "https://github.com/0xmariowu/autosearch" that are relevant to the current task. Run `npx skills add "https://github.com/0xmariowu/autosearch"` and select the relevant skills, then follow their instructions.