القائمة
Algorithm design and analysis skill for DSH; use when working on optimization, data structures, or computational procedures.
التثبيت باستخدام Codex أو Claude انسخ هذا Prompt والصقه في Codex أو Claude أو مساعد آخر ليراجع صفحة Skill ويثبّتها لك.
استنادا إلى تصنيف SOC المهني
Cognitive systems skill for reasoning, memory, and agent behavior; use when designing agent workflows or mental-model tooling.
High-performance numerical and quantum compute skill for scientific workloads; use when working on numeric algorithms, simulation, or acceleration.
Fractal geometry and self-similarity skill; use when working on recursive geometric or visual systems.
Frequency-domain and signal-processing skill; use when working on Fourier, spectral, or resonance analysis.
Financial advisor for GreenEnergyFL — tracks job finances, bills, vendor payments, cash flow, and overdue invoices. Use this skill whenever the user asks about money, payments, invoices, bills, job costs, what's owed, what's coming in, cash flow, overdue accounts, financial summaries, or anything related to GreenEnergyFL's finances. Trigger even if the user just says "check the bills", "what do we owe", "who hasn't paid", "how are we doing financially", or "show me the jobs".
General mathematical methods skill for symbolic and numerical work; use when solving equations or deriving relationships.
| name | algorithms |
| description | Algorithm design and analysis skill for DSH; use when working on optimization, data structures, or computational procedures. |
Domain: build | Depth: axiom
| Library | Purpose |
|---|---|
| networkx | Graph algorithms |
| scipy | Optimization algorithms |
| numpy | Array-based algorithm primitives |
agents/skills/algorithms.py
shortest_path(graph, src, dst) — Dijkstra shortest pathmst(graph) — minimum spanning treecentrality(graph) — betweenness + eigenvector centralityastar(grid, start, goal, heuristic) — A* pathfindinggenetic_optimize(fitness_fn, population, generations) — genetic algorithmentropy(data) — Shannon entropytopological_sort(dag) — topological ordering