skills.rest
Arcadi4
Arcadi4COMMUNITY
Explore all skills by this author →
Website𝕏@_4rcadiaGitHub

elementary-graph-algorithms

Solve graph-search and representation problems for directed and undirected graphs.

7|Updated Apr 24, 2026
Search Tags:#topological-sort#scc#graph-algorithms#clrs#breadth-first-search#depth-first-search#euler-tours
One-click install
npx skills add https://github.com/Arcadi4/nerdy --skill elementary-graph-algorithms
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: elementary-graph-algorithms
Source: https://github.com/Arcadi4/nerdy/tree/main/clrs/elementary-graph-algorithms
Command: npx skills add https://github.com/Arcadi4/nerdy --skill elementary-graph-algorithms

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

Graph-search problems require choosing the correct representation and applying traversal and decomposition techniques to reason about reachability, order, and components in both directed and undirected graphs.

Core Features & Use Cases

  • Representation guidance: choose between adjacency lists, adjacency matrices, or hybrid structures to balance space and time.
  • Traversal & analysis: apply breadth-first search, depth-first search, topological sorting, strongly connected components, edge classification, articulation points, bridges, and Euler tours with invariant reasoning.
  • Use case: analyze software dependency graphs, networks, or task flows in CLRS-style proofs to derive reachability, ordering, and component structure.

Quick Start

Construct a simple directed graph and run BFS/DFS to determine reachability and a valid topological order.

Frequently Asked Questions about elementary-graph-algorithms

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

FAQPage Schema
How do I perform topological sorting on a directed graph?▼

Breadth-first search is applied to directed and undirected graphs to compute shortest path distances and derive reachability. The Skill enforces CLRS notation to ensure rigorous invariant reasoning during traversal.

What is the best way to find strongly connected components in a graph?▼

Choosing between adjacency lists and adjacency matrices depends on balancing space and time constraints for your graph representation. The Skill provides representation guidance to select the optimal structure for traversal and analysis.

When do I need to detect articulation points and bridges in an undirected graph?▼

Euler tours are computed by applying specific graph traversal techniques to analyze edge visitation patterns. The Skill uses CLRS-style reasoning to construct and validate Euler tour sequences for connected graphs.

Can I use CLRS notation for rigorous proofs in graph traversal analysis?▼

Yes, you can use CLRS notation for rigorous proofs in graph traversal analysis. The Skill enforces explicit representation decisions and CLRS-style reasoning to validate reachability, ordering, and component structure.

Related Skills

Explore More Software Engineering Skills→
FrancisVargaFrancisVarga

Graph Algorithms

Execute PageRank, Louvain, BFS, DFS, and shortest path algorithms on in-memory property graphs.

Community
Advanced
rnavarychrnavarych
14

role-algorithms:graph-algorithms

Implement graph algorithms for traversal, shortest paths, and network flow.

Community
Advanced
curiositechcuriositech
10

dag-dependency-resolver

Validate directed acyclic graphs and produce topological orders with cycle reports.

Official
Advanced
Arcadi4Arcadi4
7

probabilistic-analysis-and-randomized-algorithms

Analyze probabilistic aspects and randomness in CLRS-style algorithms.

Community
Advanced