Babysitter plugin-dependency-resolver
Generate plugin dependency resolution logic with topological sorting.
install
source · Clone the upstream repo
git clone https://github.com/a5c-ai/babysitter
Claude Code · Install into ~/.claude/skills/
T=$(mktemp -d) && git clone --depth=1 https://github.com/a5c-ai/babysitter "$T" && mkdir -p ~/.claude/skills && cp -r "$T/library/specializations/cli-mcp-development/skills/plugin-dependency-resolver" ~/.claude/skills/a5c-ai-babysitter-plugin-dependency-resolver && rm -rf "$T"
manifest:
library/specializations/cli-mcp-development/skills/plugin-dependency-resolver/SKILL.mdsource content
Plugin Dependency Resolver
Generate plugin dependency resolution logic.
Generated Patterns
interface PluginNode { name: string; dependencies: string[]; } export function resolveDependencies(plugins: PluginNode[]): string[] { const graph = new Map<string, string[]>(); const inDegree = new Map<string, number>(); for (const plugin of plugins) { graph.set(plugin.name, plugin.dependencies); inDegree.set(plugin.name, 0); } for (const [, deps] of graph) { for (const dep of deps) { inDegree.set(dep, (inDegree.get(dep) || 0) + 1); } } const queue = [...inDegree.entries()].filter(([, d]) => d === 0).map(([n]) => n); const result: string[] = []; while (queue.length > 0) { const node = queue.shift()!; result.push(node); for (const dep of graph.get(node) || []) { inDegree.set(dep, inDegree.get(dep)! - 1); if (inDegree.get(dep) === 0) queue.push(dep); } } if (result.length !== plugins.length) { throw new Error('Circular dependency detected'); } return result.reverse(); }
Target Processes
- plugin-architecture-implementation