elementary-graph-algorithms
CommunityGraph representations and traversals with CLRS.
Software Engineering#topological-sort#scc#graph-algorithms#clrs#breadth-first-search#depth-first-search#euler-tours
AuthorArcadi4
Version1.0.0
Installs0
System Documentation
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.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: elementary-graph-algorithms Download link: https://github.com/Arcadi4/nerdy/archive/main.zip#elementary-graph-algorithms Please download this .zip file, extract it, and install it in the .claude/skills/ directory.
Agent Skills Search Helper
Install a tiny helper to your Agent, search and equip skill from 471,000+ vetted skills library on demand.