OpenParable
Skip to content
← Back to skills

Graph Algorithm Selector

Development
graph-algorithm-selector

Graph Algorithm Selector is an Agent Skill for development published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.

Select optimal graph algorithm based on problem constraints

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/algorithms-optimization/skills/graph-algorithm-selector/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/graph-algorithm-selector, but wait for my approval before writing files or running scripts.

Copying this prompt does not install or run the skill. Review third-party files before use.

Graph Algorithm Selector Skill

Purpose

Select the optimal graph algorithm based on problem constraints, graph properties, and performance requirements.

Capabilities

  • Constraint analysis for algorithm selection
  • Trade-off analysis (Dijkstra vs Bellman-Ford vs Floyd-Warshall)
  • Special case detection (sparse vs dense, negative edges)
  • Algorithm complexity mapping to constraints
  • Suggest algorithm variants and optimizations

Target Processes

  • shortest-path-algorithms
  • advanced-graph-algorithms
  • graph-traversal
  • graph-modeling

Algorithm Selection Matrix

Shortest Path

ScenarioAlgorithmComplexity
UnweightedBFSO(V+E)
Non-negative weightsDijkstraO((V+E)log V)
Negative weightsBellman-FordO(VE)
All pairsFloyd-WarshallO(V^3)
DAGTopological + DPO(V+E)

MST

ScenarioAlgorithmComplexity
Sparse graphKruskalO(E log E)
Dense graphPrimO(V^2) or O(E log V)

Input Schema

{
  "type": "object",
  "properties": {
    "problemType": {
      "type": "string",
      "enum": ["shortestPath", "mst", "connectivity", "flow", "matching", "traversal"]
    },
    "graphProperties": { "type": "object" },
    "constraints": {
      "type": "object",
      "properties": {
        "V": { "type": "integer" },
        "E": { "type": "integer" },
        "negativeWeights": { "type": "boolean" },
        "negativeCycles": { "type": "boolean" }
      }
    }
  },
  "required": ["problemType", "constraints"]
}

Output Schema

{
  "type": "object",
  "properties": {
    "success": { "type": "boolean" },
    "recommendedAlgorithm": { "type": "string" },
    "complexity": { "type": "string" },
    "alternatives": { "type": "array" },
    "reasoning": { "type": "string" }
  },
  "required": ["success", "recommendedAlgorithm"]
}