SkillAgentSearch skills...

graph-algorithms

Problem-solving strategies for graph algorithms in graph number theory

Install / Use

npx skills add parcadei/Continuous-Claude-v3 --skill graph-algorithms

Installs into whichever agent you are using.

About this skill
📄

SKILL.md

Installable skill definition

Quality Score

83/100

Supported Platforms

Universal

Tags

Our assessment of graph-algorithms

graph-algorithms scores 83/100 on our quality scale, 682nd of 947 AI & Machine Learning skills we index.

Its SKILL.md is 3.8 KB long, well organised into 10 sections with 4 code examples: a solid amount of guidance for an agent.

With 3,943 GitHub stars, it is one of the more widely adopted skills in the catalogue.

Substance
26/30
Structure
20/20
Description
12/15
Adoption
15/20
Freshness
11/15

Maintenance, license and trust

  • The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.
  • Our last check on 2026-11-06 found the source still online.
  • It is released under the MIT license, a permissive license that allows use, modification and commercial use with attribution.
  • Its trust signals score 94/100, with 1 caution from licensing, adoption, age or documentation. These come from repository metadata, not a code audit — read the skill file before letting an agent act on it.

Safety scan

No issues found

Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful.

AI review by kimi-k2.7-code on 2026-10-01. Automated pattern scan on 2026-10-01. It catches known dangerous patterns, not every risk — read a skill before letting an agent act on it.

graph-algorithms compared with similar skills

All 4 of these similar skills score higher than graph-algorithms; compare them before choosing.

SkillScoreStarsUpdatedFormat
graph-algorithms (this skill)by parcadei833.9k10mo agoSKILL.md
claude-memby thedotmack100117.6ktodayCLAUDE.md
Understand-Anythingby Egonex-AI10092.8k1d agoCLAUDE.md
headroomby headroomlabs-ai10079.8ktodayCLAUDE.md
CowAgentby zhayujie10048.0ktodayCLAUDE.md

Frequently asked questions

How do I install graph-algorithms?
Run npx skills add parcadei/Continuous-Claude-v3 --skill graph-algorithms. The install tabs above show the steps for each supported agent.
Which AI agents does graph-algorithms work with?
It is written for Universal, as a SKILL.md file. Other agents that read the same format can often use it too.
Is graph-algorithms safe to use?
Our scan of the whole file found no instruction hijacking, hidden characters, credential access, data exfiltration or destructive commands. An AI review of the same text found nothing harmful. It is MIT-licensed and scores 94/100 on trust signals. Skills are instructions an agent will follow, so read the file before installing it and do not approve commands you do not understand.
Is graph-algorithms still maintained?
The repository was last updated about 10 months ago. That is recent enough to be usable, but agent tooling moves fast, so check the instructions against your agent's current version.

name: graph-algorithms description: "Problem-solving strategies for graph algorithms in graph number theory" allowed-tools: [Bash, Read]

Graph Algorithms

When to Use

Use this skill when working on graph-algorithms problems in graph number theory.

Decision Tree

  1. Traversal selection

    • BFS: shortest paths (unweighted), level structure
    • DFS: cycle detection, topological sort, SCC
  2. Shortest path algorithms | Algorithm | Use Case | Complexity | |-----------|----------|------------| | Dijkstra | Non-negative weights | O((V+E) log V) | | Bellman-Ford | Negative weights | O(VE) | | Floyd-Warshall | All pairs | O(V^3) |

  3. Minimum Spanning Tree

    • Prim's: dense graphs, greedy from vertex
    • Kruskal's: sparse graphs, union-find
    • z3_solve.py prove "cut_property"
  4. Network Flow

    • Max-flow = min-cut (Ford-Fulkerson)
    • Matching via flow network
    • sympy_compute.py linsolve "flow_conservation"
  5. Graph properties

    • Spectral: eigenvalues of adjacency matrix
    • Connectivity: via DFS/BFS
    • Coloring: greedy or SAT reduction

Tool Commands

Sympy_Adjacency

uv run python -m runtime.harness scripts/sympy_compute.py eigenvalues "adjacency_matrix"

Z3_Dijkstra

uv run python -m runtime.harness scripts/z3_solve.py prove "d[v] >= d[u] + w(u,v) for all edges"

Z3_Mst_Cut

uv run python -m runtime.harness scripts/z3_solve.py prove "min_edge_crossing_cut_in_mst"

Sympy_Flow

uv run python -m runtime.harness scripts/sympy_compute.py linsolve "flow_conservation_equations"

Key Techniques

From indexed textbooks:

  • [Graph Theory (Graduate Texts in Mathematics (173))] Given two numerical graph invariants i1 and i2, write i1 i2 if we can force i2 to be arbitrarily high on some subgraph of G by assuming that i1(G) is large enough. Formally: write i1 i2 if there exists a function f : N → N such that, given any k ∈ N, every graph G with i1(G) f (k) has a subgraph H with i2(H) k. If i1 i2 as well as i1 i2, write i1 ∼ i2.
  • [Graph Theory (Graduate Texts in Mathematics (173))] Find the smallest integer b = b(k) such that every graph of order n with more than kn + b edges has a (k + 1)-edge- connected subgraph, for every k ∈ N. Show that every tree T has at least Δ(T ) leaves. Show that a tree without a vertex of degree 2 has more leaves than other vertices.
  • [Graph Theory (Graduate Texts in Mathematics (173))] For every n > 1, nd a bipartite graph on 2n vertices, ordered in such a way that the greedy algorithm uses n rather than 2 colours. Exercises Consider the following approach to vertex colouring. First, nd a max- imal independent set of vertices and colour these with colour 1; then nd a maximal independent set of vertices in the remaining graph and colour those 2, and so on.
  • [Graph Theory (Graduate Texts in Mathematics (173))] Show that, for every r ∈ N, every innite graph of upper density s subgraph for every s ∈ N. Deduce that the upper density of innite graphs can only take r−1 has a K r the countably many values of 0, 1, 1 2 , 2 3 , 3 4 Extremal Graph Theory Given a tree T , nd an upper bound for ex(n, T ) that is linear in n and independent of the structure of T , i. Prove the Erd˝os-S´os conjecture for the case when the tree considered is a star.
  • [Graph Theory (Graduate Texts in Mathematics (173))] Colouring Slightly more generally, a class G of graphs is called χ-bounded if there exists a function f : N → N such that χ(G) f (r) for every graph G ⊇ Kr in G. In such graphs, then, we can force a Kr subgraph by making χ larger than f (r). Show that the four colour theorem does indeed solve the map colouring problem stated in the rst sentence of the chapter.

Cognitive Tools Reference

See .claude/skills/math-mode/SKILL.md for full tool documentation.

Related Skills

View on GitHub
GitHub Stars3.9k
CategoryAI
Updated9mo ago
Forks303

Languages

Python

Trust signals

94/100

From repository metadata: license, adoption, age and documentation. Not a code audit — see the Safety scan above for what the skill file itself contains.

1 low