Every premium and members-only resource for $9.99/month, as a no-commitment subscription. See the plans

PalateKit

Sign in
Menu

Request a resource

Describe the resource you are missing in one sentence. We will email you when it is published.

0 / 280

A page, a video or an image online.

Unlock PalateKit

Unlock everything

Plan

Paying means accepting our terms of sale.

Secure payment by Stripe. Receipts and invoices sent by email.

Welcome back

Sign in to install, download or save this resource. A free account is enough for free resources.

Graph algorithms: traversal and shortest paths v1.0.0

Use this resource to choose and apply a traversal or shortest path algorithm on a graph

New

  • 424 downloads
  • 210 likes
  • 171 saves

Free

Install with the CLI

In a terminal, from the folder you want:

npx --yes palatekit@latest install graph-shortest-path-choice

With no option, the skill goes to ~/.agents/skills/; add --agent claude-code (or codex, cursor…) to target an agent.

First time: connect the CLI with

npx --yes palatekit@latest login

The agent guides the choice between breadth-first and depth-first search, then between Dijkstra, Bellman-Ford, Floyd-Warshall, Prim and Kruskal, depending on edge weights and graph density. It suggests SymPy and Z3 commands to check the result. You get the chosen algorithm with its complexity.

Mostly picked by

Updated November 2, 2026

Card for the “Graph algorithms: traversal and shortest paths” skill

Details

Works in
Install guides
Generates with
Your agent's model
Licence
MIT

Similar resources

View all

What you get

  • SKILL.md: decision tree (traversal, shortest paths, spanning tree, flow) with complexities
  • SKILL.md: SymPy commands (adjacency, flow) and Z3 (Dijkstra, minimum cut)

Good fit for

  • You are looking for the shortest path in a graph with positive weights
  • You need to detect a cycle or order tasks

Not for

    Tags

    • graphs
    • shortest path
    • spanning tree
    • traversal

    About

    You say

    “Which algorithm should I use to find the shortest path in this graph with negative weights?”

    Card for the “Graph algorithms: traversal and shortest paths” skill

    Skill published by parcadei under the MIT license, delivered in its original version.

    Show more

    How to use it

    1. Install the skill in your agent's skills folder
    2. Ask your agent to choose and apply a traversal or shortest path algorithm on a graph
    3. Review and adjust the result

    Content preview

    Files

    • LICENSE1.1 KB
    • NOTICE-PALATEKIT.md0.5 KB
    • SKILL.md3.9 KB

    Origin and licence

    Listed unmodified

    Author
    parcadei
    Source
    github.com/parcadei/continuous-claude-v3/tree/d07ff4b06b62f43771bc0c927d0211b734d6149e/.claude/skills/math/graph-number-theory/graph-algorithms
    Licence
    MIT

    Notice

    « graph-algorithms » (parcadei, MIT) livré dans sa version d'origine : fiche en français et en anglais par PalateKit.

    User reviews

    –

    No ratings yet

    Loading reviews…

    Delete your review?

    Your rating and comment will be removed from the page.