Skip to content

CSCI2100 · Method · Chapter 13 · Graph traversal

Depth-first search

1 steps of prerequisites below it

Depth-first search colours vertices white, gray and black, follows one path as far as possible, records discovery and finish times, and restarts from every white vertex to build a DFS forest in Θ(n + m) time.

Taught in

Builds on

Used by

Lenses

Everything this builds on, earliest first · 1 steps

Each step comes after its own prerequisites, so reading in this order never needs something you have not met. It is a reading order for these notes, not a diagnosis of what you know.

  1. Adjacency matrix and adjacency lists · 13.2

Possible roots and a review route need your own answers on these points. None are recorded yet, so none are suggested.

Longest chain down to a starting point

Each step is used by the one above it, across courses where the notes link them. It ends at a point the notes define without another point.

  1. Adjacency matrix and adjacency lists

Back to the graph →Read the note 13.2 →

Vercel visit statistics and public-page performance measurements each require separate consent. Neither is needed to use the website.

Website function storage (used when needed)

Security, sign-in and your chosen preferences use storage when needed. This is separate from optional statistics.

Withdrawing stops future statistics. The page reloads if analytics code needs unloading. It does not delete data already sent.

Read Cookie and storage details