An interactive concept flow for representing a graph before traversing it, from its assumptions through the main operation and boundary checks.
trace / request.md
readyA graph models entities as vertices and relationships as edges. Before choosing an algorithm, decide whether edges are directed, weighted, duplicated, or allowed to change. Those choices affect both the meaning of a path and the representation needed to answer queries efficiently.
Use the stages in order to explain representing a graph before traversing it. Each stage makes one assumption visible: what the operation promises, what representation it uses, how state changes, which boundary can invalidate a shortcut, and what evidence confirms the result.
For a worked explanation, continue to the topic article and execution trace.
Not started
Sign in to save your learning progress.