graph-modeler
Convert problem descriptions into graph representations
它会碰到什么
扫了多少2 个文本文件,3 KB
它会碰到什么不碰外部(只输出文字)
命中总数0 处
命中统计严重 0 · 高 0 · 中 0 · 低 0
这一栏是扫描器报的事实,不是结论。命中多不等于有毒(安全工具、规则库、示例脚本本来就会包含危险写法),命中少也不等于干净。它和你手上的凭据、文件、网络有什么关系,需要你自己看。
技能内容
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
- Entity Identification: What objects/states become nodes?
- Relationship Analysis: What connections become edges?
- Edge Properties: Directed? Weighted? Capacities?
- Graph Properties: Special structure to exploit?
- Representation Choice: List vs matrix vs implicit?
Input Schema
{
"type": "object",
"properties": {
"problemDescription": { "type": "string" },
"constraints": { "type": "object" },
"examples": { "type": "array" },
"outputFormat": {
"type": "string",
"enum": ["analysis", "code", "visualization"]
}
},
"required": ["problemDescription"]
}
Output Schema
{
"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"]
}想直接用这个技能?
本站把开放许可(MIT / Apache 等)的技能按仓库打包整理到网盘,点一下转存到你自己的网盘,不用一个个从 GitHub 拉。许可未声明的技能只给原始仓库链接,不打包。
它属于哪个仓库
星标★ 1,796
本站分层T1
该仓技能数2115
原文件路径
library/specializations/algorithms-optimization/skills/graph-modeler/SKILL.md