Turn a problem description into a graph by identifying its objects and connections. The skill can classify graph properties, suggest a suitable storage format such as a list or matrix, and point to relevant algorithms for analysis or implementation.
Convert problem descriptions into graph representations
Run score Not tested
See how to installReview the instructions the agent will receive before you install.
Convert problem descriptions into appropriate graph representations, identifying entities as nodes and relationships as edges.
{
"type": "object",
"properties": {
"problemDescription": { "type": "string" },
"constraints": { "type": "object" },
"examples": { "type": "array" },
"outputFormat": {
"type": "string",
"enum": ["analysis", "code", "visualization"]
}
},
"required": ["problemDescription"]
}
{
"type": "object",
"properties": {
"success": { "type": "boolean" },
"nodes": { "type": "object" },
"edges": { "type": "object" },
"properties": {
"type": "object",
"properties": {
"directed": { "type": "boolean" },
"weighted": { "type": "boolean" },
"bipartite": { "type": "boolean" },
"dag": { "type": "boolean" },
"tree": { "type": "boolean" }
}
},
"representation": { "type": "string" },
"suggestedAlgorithms": { "type": "array" }
},
"required": ["success"]
}
No reviews yet. Tell others what you thought.
No login needed. Share how it worked for you, ask a question, or note where it did not run.
No comments yet. Be the first to write one.
Get implementations and guidance for advanced data structures used in competitive programming and complex algorithm problems. The skill covers balanced trees, persistent structures, tree decompositions, and range-query tools, with usage notes and complexity information.
Use this skill for an independent, evidence-based code review focused on whether an implementation meets its specification. It returns a clear PASS or FAIL verdict with file and line references, using a fresh reviewer for each re-review.
WASM-based instant code transforms for simple tasks, achieving 352x speedup over LLM inference with zero cost.
The English summary is being prepared. Showing the original description.
Coordinates long-lived Crew agents and transient Polecat workers by assigning work through hooks, handing tasks between agents, and nudging stalled sessions. It also explains a three-level hook hierarchy and provides commands for listing, feeding, and reviving agents.
Turn algorithm execution into visual steps, showing how arrays, trees, graphs, and dynamic programming tables change. Generate formats such as ASCII, SVG, GIF, or HTML to explain concepts, inspect behavior, or support debugging.
Coordinate multi-agent work with short task cycles and regular checkpoints. The skill checks whether agents share consistent state and stay within assigned roles, then scores drift and guides corrections or human escalation when needed.