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 | Scenario | Algorithm…