skills.rest
parcadei
parcadeiCOMMUNITY
Explore all skills by this author →
GitHub

graph-algorithms

Provides graph algorithm strategies and tool commands using Sympy and Z3.

3.9k|296|Updated Dec 23, 2025
Search Tags:#bfs#dfs#mst#graph algorithms#dijkstra#network flow#number theory
One-click install
npx skills add https://github.com/parcadei/Continuous-Claude-v3 --skill graph-algorithms-parcadei
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: graph-algorithms
Source: https://github.com/parcadei/Continuous-Claude-v3/tree/main/.claude/skills/math/graph-number-theory/graph-algorithms
Command: npx skills add https://github.com/parcadei/Continuous-Claude-v3 --skill graph-algorithms-parcadei

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill provides strategies and tools for solving complex problems within graph algorithms, specifically in the domain of graph number theory.

Core Features & Use Cases

  • Algorithm Selection: Guides the choice between BFS, DFS, Dijkstra, Bellman-Ford, Floyd-Warshall, Prim's, Kruskal's, and network flow algorithms based on problem specifics.
  • Property Analysis: Assists in analyzing graph properties like spectral characteristics, connectivity, and coloring.
  • Use Case: When faced with a problem requiring the shortest path in a graph with negative edge weights, this skill will guide you to use the Bellman-Ford algorithm and provide the relevant tool command.

Quick Start

Use the graph-algorithms skill to find the shortest paths in an unweighted graph.

Frequently Asked Questions about graph-algorithms

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I choose the right shortest path algorithm for a graph with negative edge weights?▼

To find the shortest path in an unweighted graph, use Breadth-First Search (BFS). This skill provides tool commands and strategies to quickly execute BFS for unweighted graph traversal.

How do I analyze graph properties like connectivity and coloring?▼

You can analyze graph properties like spectral characteristics, connectivity, and coloring using Sympy and Z3. The skill assists in these computations to solve complex graph number theory problems.

What's the best way to select between Prim's and Kruskal's for a minimum spanning tree?▼

Selecting between Prim's and Kruskal's for a minimum spanning tree depends on your graph's specifics. This skill provides algorithm selection guidance to determine the optimal approach for your MST problem.

Do I need Sympy or Z3 to solve graph number theory problems?▼

Yes, utilizing Sympy and Z3 is required for mathematical proofs and computations within this skill. These tools are leveraged to solve complex graph algorithms and analyze graph properties effectively.

How do I handle network flow problems in graph algorithms?▼

To handle network flow problems, this skill provides specific problem-solving strategies and tool commands. It guides you through the appropriate algorithm selection for your network flow requirements.

Related Skills

Explore More Software Engineering Skills→
scooter-lacroixscooter-lacroix
8

continuity

Verify function continuity by checking definitions, computing limits with SymPy, and proving properties via Z3.

Community
Intermediate
sanand0sanand0
8

networkx

Create, analyze, and visualize complex networks and graphs in Python.

Community
Advanced
rainoftimerainoftime
17

model-checker

Verify finite-state systems with SAT/SMT solvers and generate counterexamples.

Community
Advanced
sandraschisandraschi
18

discrete-mathematics-expert

Solve discrete mathematics problems in combinatorics, graph theory, and algorithms.

Community
Advanced