II.
LibrarySkill overview
Reference · livelib-skill:algorithms-optimization--graph-algorithm-selector
graph-algorithm-selector overview
Select optimal graph algorithm based on problem constraints
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
## 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 c
Outgoing edges
lib_applies_to_domain1
- domain:computer-science·DomainComputer Science
lib_belongs_to_specialization1
- specialization:algorithms-optimization·Specialization
lib_involves_role2
- role:backend-engineer·RoleBackend Engineer
- role:computational-scientist·RoleComputational Scientist
lib_requires_skill_area1
- skill-area:graph-algorithms·SkillAreaGraph Algorithms
Incoming edges
None.