The Runtime Theory

topic / graph-algorithms

Graph Algorithms

Model relationships explicitly and compute over paths and components.

Learn graph representations, traversal, topological ordering, shortest paths, spanning trees, and connectivity algorithms.

1 article · 1 video · 1 trace · 1 request flow · 1 interview · 5 total

Articles

graph algorithmsSep 25, 2026

Representing a Graph Before Traversing It

A graph models entities as vertices and relationships as edges.

Request Flows

request flow · 5 stagesHow Representing a Graph Before Traversing It worksAn interactive concept flow for representing a graph before traversing it, from its assumptions through the main operation and boundary checks.

Videos

graph algorithmsSep 25, 2026

Video lesson: Representing a Graph Before Traversing It

Recording brief and narration plan for a visual lesson on representing a graph before traversing it.

Traces

trace 01 · runtimeTrace: Representing a Graph Before Traversing ItFollow the key state changes and boundary checks involved in representing a graph before traversing it.

Interviews

medium · t2Explain Representing a Graph Before Traversing ItExplain the model, execution steps, complexity, and limits of representing a graph before traversing it.

Explore adjacent

programming algorithms

New lessons by email

Get new explanations about graph algorithms and related systems in your inbox.

One technical dispatch per week. No noise.