Convert problem descriptions into graph representations
Scanned 9/2/2026
Install to Claude Code
npx -y skills add a5c-ai/babysitter --skill graph-modeler --agent claude-codeInstalls into .claude/skills of the current project.
Are you the author of Graph Modeler?
Add the live security badge to your README — it updates automatically with every re-scan.
[](https://www.skillsdirectory.com/skills/a5c-ai-graph-modeler)More formats (shields.io, HTML) on the badges page.
---
name: graph-modeler
description: Convert problem descriptions into graph representations
allowed-tools:
- Read
- Write
- Grep
- Glob
graph:
domains: [domain:computer-science]
specializations: [specialization:algorithms-optimization]
skillAreas: [skill-area:graph-algorithms]
roles: [role:backend-engineer, role:computational-scientist]
---
# Graph Modeler Skill
## Purpose
Convert problem descriptions into appropriate graph representations, identifying entities as nodes and relationships as edges.
## Capabilities
- Entity-to-node mapping from problem text
- Relationship-to-edge mapping
- Graph property detection (bipartite, DAG, tree, etc.)
- Suggest optimal representation (adjacency list vs matrix)
- Generate graph visualization
- Identify implicit graph structures
## Target Processes
- graph-modeling
- shortest-path-algorithms
- graph-traversal
- advanced-graph-algorithms
## Graph Modeling Framework
1. **Entity Identification**: What objects/states become nodes?
2. **Relationship Analysis**: What connections become edges?
3. **Edge Properties**: Directed? Weighted? Capacities?
4. **Graph Properties**: Special structure to exploit?
5. **Representation Choice**: List vs matrix vs implicit?
## Input Schema
```json
{
"type": "object",
"properties": {
"problemDescription": { "type": "string" },
"constraints": { "type": "object" },
"examples": { "type": "array" },
"outputFormat": {
"type": "string",
"enum": ["analysis", "code", "visualization"]
}
},
"required": ["problemDescription"]
}
```
## Output Schema
```json
{
"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"]
}
```
Is this your skill, or is something wrong with this listing? Request removal or report an issue. Author removals are honored within 72 hours.
No comments yet. Be the first to comment!