Graph traversal

Systematic visits to vertices and edges of a graph.

Key question

How do I choose an algorithm?

Check your understanding

Find an example, an application and a limit. Explain the concept without using its name, then compare your explanation with a primary source.

Loading your learning…

Claims to examine

  • Algorithm choice depends on correctness, input structure and resource constraints as well as asymptotic growth.

    Editorial claim · contestedExamine the source →

Follow a learning route

Reading connections