{
  "id": "lib-skill:algorithms-optimization--graph-algorithm-selector",
  "_kind": "LibrarySkill",
  "_file": "generated-library/skills.yaml",
  "_cluster": "generated-library",
  "attributes": {
    "displayName": "graph-algorithm-selector",
    "description": "Select optimal graph algorithm based on problem constraints",
    "libraryPath": "library/specializations/algorithms-optimization/skills/graph-algorithm-selector/SKILL.md",
    "specialization": "algorithms-optimization",
    "contentSummary": "# Graph Algorithm Selector Skill\n\n## Purpose\n\nSelect the optimal graph algorithm based on problem constraints, graph properties, and performance requirements.\n\n## Capabilities\n\n- Constraint analysis for algorithm selection\n- Trade-off analysis (Dijkstra vs Bellman-Ford vs Floyd-Warshall)\n- Special c"
  },
  "outgoingEdges": [
    {
      "from": "lib-skill:algorithms-optimization--graph-algorithm-selector",
      "to": "skill-area:graph-algorithms",
      "kind": "lib_requires_skill_area",
      "attributes": {
        "weight": 1
      }
    },
    {
      "from": "lib-skill:algorithms-optimization--graph-algorithm-selector",
      "to": "domain:computer-science",
      "kind": "lib_applies_to_domain",
      "attributes": {
        "weight": 1
      }
    },
    {
      "from": "lib-skill:algorithms-optimization--graph-algorithm-selector",
      "to": "role:backend-engineer",
      "kind": "lib_involves_role",
      "attributes": {
        "weight": 1
      }
    },
    {
      "from": "lib-skill:algorithms-optimization--graph-algorithm-selector",
      "to": "role:computational-scientist",
      "kind": "lib_involves_role",
      "attributes": {
        "weight": 0.7
      }
    },
    {
      "from": "lib-skill:algorithms-optimization--graph-algorithm-selector",
      "to": "specialization:algorithms-optimization",
      "kind": "lib_belongs_to_specialization",
      "attributes": {
        "weight": 1
      }
    }
  ],
  "incomingEdges": []
}